./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d16_e0.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.arbitrated_top_n3_w8_d16_e0.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 ac363d7e090ca55a75a0285e2258678dcb16cc73e221709825b3dff0c610d839 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:11:27,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:11:27,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:11:27,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:11:27,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:11:27,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:11:27,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:11:27,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:11:27,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:11:27,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:11:27,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:11:27,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:11:27,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:11:27,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:11:27,810 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:11:27,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:11:27,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:11:27,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:11:27,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:11:27,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:11:27,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:11:27,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:11:27,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:11:27,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:11:27,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:11:27,813 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 -> ac363d7e090ca55a75a0285e2258678dcb16cc73e221709825b3dff0c610d839 [2025-02-07 22:11:28,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:11:28,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:11:28,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:11:28,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:11:28,057 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:11:28,061 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.arbitrated_top_n3_w8_d16_e0.c [2025-02-07 22:11:29,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a208b801b/fdb678eff87c4bceaa4723500cdc37d0/FLAG8fca77bd9 [2025-02-07 22:11:29,563 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:11:29,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w8_d16_e0.c [2025-02-07 22:11:29,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a208b801b/fdb678eff87c4bceaa4723500cdc37d0/FLAG8fca77bd9 [2025-02-07 22:11:29,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a208b801b/fdb678eff87c4bceaa4723500cdc37d0 [2025-02-07 22:11:29,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:11:29,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:11:29,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:11:29,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:11:29,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:11:29,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:11:29" (1/1) ... [2025-02-07 22:11:29,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a707027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:29, skipping insertion in model container [2025-02-07 22:11:29,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:11:29" (1/1) ... [2025-02-07 22:11:29,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:11:29,762 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.arbitrated_top_n3_w8_d16_e0.c[1270,1283] [2025-02-07 22:11:30,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:11:30,036 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:11:30,044 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.arbitrated_top_n3_w8_d16_e0.c[1270,1283] [2025-02-07 22:11:30,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:11:30,203 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:11:30,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30 WrapperNode [2025-02-07 22:11:30,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:11:30,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:11:30,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:11:30,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:11:30,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,649 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5201 [2025-02-07 22:11:30,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:11:30,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:11:30,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:11:30,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:11:30,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,900 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 22:11:30,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:30,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:11:31,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:11:31,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:11:31,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:11:31,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (1/1) ... [2025-02-07 22:11:31,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:11:31,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:11:31,228 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 22:11:31,230 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 22:11:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:11:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:11:31,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:11:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:11:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:11:31,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:11:31,577 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:11:31,579 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:11:35,389 INFO L? ?]: Removed 2956 outVars from TransFormulas that were not future-live. [2025-02-07 22:11:35,389 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:11:35,564 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:11:35,568 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:11:35,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:11:35 BoogieIcfgContainer [2025-02-07 22:11:35,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:11:35,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:11:35,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:11:35,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:11:35,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:11:29" (1/3) ... [2025-02-07 22:11:35,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a91de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:11:35, skipping insertion in model container [2025-02-07 22:11:35,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:11:30" (2/3) ... [2025-02-07 22:11:35,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a91de82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:11:35, skipping insertion in model container [2025-02-07 22:11:35,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:11:35" (3/3) ... [2025-02-07 22:11:35,576 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w8_d16_e0.c [2025-02-07 22:11:35,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:11:35,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n3_w8_d16_e0.c that has 2 procedures, 1480 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:11:35,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:11:35,668 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;@4a20af36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:11:35,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:11:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 1480 states, 1467 states have (on average 1.496250852079073) internal successors, (2195), 1468 states have internal predecessors, (2195), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-07 22:11:35,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:35,703 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:35,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:35,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:35,708 INFO L85 PathProgramCache]: Analyzing trace with hash 899282503, now seen corresponding path program 1 times [2025-02-07 22:11:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729619397] [2025-02-07 22:11:35,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:35,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-07 22:11:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-07 22:11:35,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:35,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-07 22:11:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729619397] [2025-02-07 22:11:36,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729619397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:11:36,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366857030] [2025-02-07 22:11:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:36,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:11:36,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:11:36,398 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 22:11:36,399 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 22:11:36,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-07 22:11:37,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-07 22:11:37,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:37,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 2447 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:11:37,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:11:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-07 22:11:37,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:11:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366857030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:11:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:11:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006582340] [2025-02-07 22:11:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:37,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:11:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:37,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:11:37,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:11:37,312 INFO L87 Difference]: Start difference. First operand has 1480 states, 1467 states have (on average 1.496250852079073) internal successors, (2195), 1468 states have internal predecessors, (2195), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:37,718 INFO L93 Difference]: Finished difference Result 2697 states and 4048 transitions. [2025-02-07 22:11:37,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:11:37,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 444 [2025-02-07 22:11:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:37,730 INFO L225 Difference]: With dead ends: 2697 [2025-02-07 22:11:37,730 INFO L226 Difference]: Without dead ends: 1478 [2025-02-07 22:11:37,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:11:37,742 INFO L435 NwaCegarLoop]: 1849 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:37,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1849 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:11:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-02-07 22:11:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2025-02-07 22:11:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1466 states have (on average 1.494542974079127) internal successors, (2191), 1466 states have internal predecessors, (2191), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2211 transitions. [2025-02-07 22:11:37,843 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2211 transitions. Word has length 444 [2025-02-07 22:11:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:37,846 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2211 transitions. [2025-02-07 22:11:37,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 199.5) internal successors, (399), 2 states have internal predecessors, (399), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2211 transitions. [2025-02-07 22:11:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-07 22:11:37,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:37,856 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:37,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 22:11:38,058 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,SelfDestructingSolverStorable0 [2025-02-07 22:11:38,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash -598681987, now seen corresponding path program 1 times [2025-02-07 22:11:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863794984] [2025-02-07 22:11:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:38,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-02-07 22:11:38,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-02-07 22:11:38,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:38,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863794984] [2025-02-07 22:11:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863794984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:11:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758982935] [2025-02-07 22:11:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:11:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:39,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:11:39,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:11:39,945 INFO L87 Difference]: Start difference. First operand 1478 states and 2211 transitions. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:40,532 INFO L93 Difference]: Finished difference Result 1482 states and 2215 transitions. [2025-02-07 22:11:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 444 [2025-02-07 22:11:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:40,537 INFO L225 Difference]: With dead ends: 1482 [2025-02-07 22:11:40,537 INFO L226 Difference]: Without dead ends: 1480 [2025-02-07 22:11:40,538 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 22:11:40,538 INFO L435 NwaCegarLoop]: 1847 mSDtfsCounter, 0 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:40,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5536 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:11:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-07 22:11:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-07 22:11:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1468 states have (on average 1.4938692098092643) internal successors, (2193), 1468 states have internal predecessors, (2193), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2213 transitions. [2025-02-07 22:11:40,558 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2213 transitions. Word has length 444 [2025-02-07 22:11:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:40,560 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2213 transitions. [2025-02-07 22:11:40,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2213 transitions. [2025-02-07 22:11:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-02-07 22:11:40,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:40,564 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:40,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:11:40,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:40,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:40,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1374592066, now seen corresponding path program 1 times [2025-02-07 22:11:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924281044] [2025-02-07 22:11:40,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:40,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-02-07 22:11:40,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-02-07 22:11:40,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:40,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:41,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924281044] [2025-02-07 22:11:41,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924281044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:41,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:41,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:41,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764809976] [2025-02-07 22:11:41,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:41,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:41,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:41,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:41,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:41,581 INFO L87 Difference]: Start difference. First operand 1480 states and 2213 transitions. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:43,053 INFO L93 Difference]: Finished difference Result 3698 states and 5532 transitions. [2025-02-07 22:11:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:11:43,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 445 [2025-02-07 22:11:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:43,058 INFO L225 Difference]: With dead ends: 3698 [2025-02-07 22:11:43,059 INFO L226 Difference]: Without dead ends: 1480 [2025-02-07 22:11:43,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:11:43,061 INFO L435 NwaCegarLoop]: 1842 mSDtfsCounter, 4410 mSDsluCounter, 3242 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4416 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:43,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4416 Valid, 5084 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-07 22:11:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-07 22:11:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-07 22:11:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1468 states have (on average 1.4931880108991826) internal successors, (2192), 1468 states have internal predecessors, (2192), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2212 transitions. [2025-02-07 22:11:43,090 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2212 transitions. Word has length 445 [2025-02-07 22:11:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:43,091 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2212 transitions. [2025-02-07 22:11:43,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2212 transitions. [2025-02-07 22:11:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-02-07 22:11:43,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:43,098 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:43,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:11:43,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1338286757, now seen corresponding path program 1 times [2025-02-07 22:11:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:43,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936572801] [2025-02-07 22:11:43,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:43,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-02-07 22:11:43,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-02-07 22:11:43,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:43,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936572801] [2025-02-07 22:11:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936572801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:43,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659625616] [2025-02-07 22:11:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:43,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:43,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:43,966 INFO L87 Difference]: Start difference. First operand 1480 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:45,085 INFO L93 Difference]: Finished difference Result 2699 states and 4033 transitions. [2025-02-07 22:11:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 446 [2025-02-07 22:11:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:45,090 INFO L225 Difference]: With dead ends: 2699 [2025-02-07 22:11:45,090 INFO L226 Difference]: Without dead ends: 1480 [2025-02-07 22:11:45,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:45,091 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 4061 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:45,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 2787 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:11:45,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-07 22:11:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-07 22:11:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1468 states have (on average 1.4925068119891007) internal successors, (2191), 1468 states have internal predecessors, (2191), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2211 transitions. [2025-02-07 22:11:45,112 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2211 transitions. Word has length 446 [2025-02-07 22:11:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:45,112 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2211 transitions. [2025-02-07 22:11:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2211 transitions. [2025-02-07 22:11:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-02-07 22:11:45,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:45,116 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:11:45,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1946495949, now seen corresponding path program 1 times [2025-02-07 22:11:45,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271916220] [2025-02-07 22:11:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:45,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-02-07 22:11:45,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-02-07 22:11:45,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:45,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:45,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271916220] [2025-02-07 22:11:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271916220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:45,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136593654] [2025-02-07 22:11:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:45,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:45,683 INFO L87 Difference]: Start difference. First operand 1480 states and 2211 transitions. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:46,737 INFO L93 Difference]: Finished difference Result 2699 states and 4031 transitions. [2025-02-07 22:11:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:46,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 447 [2025-02-07 22:11:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:46,742 INFO L225 Difference]: With dead ends: 2699 [2025-02-07 22:11:46,742 INFO L226 Difference]: Without dead ends: 1480 [2025-02-07 22:11:46,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:46,744 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 2071 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:46,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 2800 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:11:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-07 22:11:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-07 22:11:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1468 states have (on average 1.491825613079019) internal successors, (2190), 1468 states have internal predecessors, (2190), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2210 transitions. [2025-02-07 22:11:46,765 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2210 transitions. Word has length 447 [2025-02-07 22:11:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:46,765 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2210 transitions. [2025-02-07 22:11:46,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2210 transitions. [2025-02-07 22:11:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-02-07 22:11:46,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:46,770 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:11:46,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:46,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash 335614734, now seen corresponding path program 1 times [2025-02-07 22:11:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273834125] [2025-02-07 22:11:46,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:46,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-02-07 22:11:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-02-07 22:11:46,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:46,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:47,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273834125] [2025-02-07 22:11:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273834125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:47,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:47,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622729593] [2025-02-07 22:11:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:47,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:47,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:47,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:47,390 INFO L87 Difference]: Start difference. First operand 1480 states and 2210 transitions. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:48,379 INFO L93 Difference]: Finished difference Result 2699 states and 4029 transitions. [2025-02-07 22:11:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:48,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 448 [2025-02-07 22:11:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:48,384 INFO L225 Difference]: With dead ends: 2699 [2025-02-07 22:11:48,384 INFO L226 Difference]: Without dead ends: 1480 [2025-02-07 22:11:48,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:48,386 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 3869 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3873 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:48,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3873 Valid, 2787 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:11:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2025-02-07 22:11:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2025-02-07 22:11:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1468 states have (on average 1.4911444141689374) internal successors, (2189), 1468 states have internal predecessors, (2189), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2209 transitions. [2025-02-07 22:11:48,404 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2209 transitions. Word has length 448 [2025-02-07 22:11:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:48,404 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 2209 transitions. [2025-02-07 22:11:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:11:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2209 transitions. [2025-02-07 22:11:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-02-07 22:11:48,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:48,407 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:48,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:11:48,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:48,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1416463482, now seen corresponding path program 1 times [2025-02-07 22:11:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665975130] [2025-02-07 22:11:48,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:48,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-02-07 22:11:48,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-02-07 22:11:48,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:48,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665975130] [2025-02-07 22:11:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665975130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:11:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000922179] [2025-02-07 22:11:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:49,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:11:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:49,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:11:49,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:11:49,030 INFO L87 Difference]: Start difference. First operand 1480 states and 2209 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:49,523 INFO L93 Difference]: Finished difference Result 2701 states and 4030 transitions. [2025-02-07 22:11:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:49,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 449 [2025-02-07 22:11:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:49,527 INFO L225 Difference]: With dead ends: 2701 [2025-02-07 22:11:49,527 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:49,528 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 22:11:49,529 INFO L435 NwaCegarLoop]: 1843 mSDtfsCounter, 0 mSDsluCounter, 3678 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5521 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:49,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5521 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:11:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4904761904761905) internal successors, (2191), 1470 states have internal predecessors, (2191), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2211 transitions. [2025-02-07 22:11:49,546 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2211 transitions. Word has length 449 [2025-02-07 22:11:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:49,546 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2211 transitions. [2025-02-07 22:11:49,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2211 transitions. [2025-02-07 22:11:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-02-07 22:11:49,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:49,549 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:49,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:11:49,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:49,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 970815440, now seen corresponding path program 1 times [2025-02-07 22:11:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371529872] [2025-02-07 22:11:49,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-02-07 22:11:49,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-02-07 22:11:49,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:49,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:50,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:50,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371529872] [2025-02-07 22:11:50,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371529872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:50,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:50,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:11:50,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515406002] [2025-02-07 22:11:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:50,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:11:50,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:50,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:11:50,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:11:50,271 INFO L87 Difference]: Start difference. First operand 1482 states and 2211 transitions. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:50,948 INFO L93 Difference]: Finished difference Result 2703 states and 4031 transitions. [2025-02-07 22:11:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:50,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 450 [2025-02-07 22:11:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:50,952 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:50,952 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:50,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:50,954 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 1934 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:50,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 3463 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:50,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.489795918367347) internal successors, (2190), 1470 states have internal predecessors, (2190), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2210 transitions. [2025-02-07 22:11:50,969 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2210 transitions. Word has length 450 [2025-02-07 22:11:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:50,969 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2210 transitions. [2025-02-07 22:11:50,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2210 transitions. [2025-02-07 22:11:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-02-07 22:11:50,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:50,972 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:50,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:11:50,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:50,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash 490072697, now seen corresponding path program 1 times [2025-02-07 22:11:50,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:50,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683051250] [2025-02-07 22:11:50,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:51,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-02-07 22:11:51,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-02-07 22:11:51,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:51,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683051250] [2025-02-07 22:11:51,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683051250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:51,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:51,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530381985] [2025-02-07 22:11:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:51,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:51,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:51,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:51,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:51,457 INFO L87 Difference]: Start difference. First operand 1482 states and 2210 transitions. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:52,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:52,101 INFO L93 Difference]: Finished difference Result 2703 states and 4029 transitions. [2025-02-07 22:11:52,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:52,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 451 [2025-02-07 22:11:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:52,106 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:52,107 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:52,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:52,110 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 4109 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:52,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 3463 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:52,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4891156462585033) internal successors, (2189), 1470 states have internal predecessors, (2189), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2209 transitions. [2025-02-07 22:11:52,132 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2209 transitions. Word has length 451 [2025-02-07 22:11:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2209 transitions. [2025-02-07 22:11:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2209 transitions. [2025-02-07 22:11:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-02-07 22:11:52,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:52,135 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:52,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:11:52,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:52,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash 439756043, now seen corresponding path program 1 times [2025-02-07 22:11:52,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:52,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660260585] [2025-02-07 22:11:52,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-02-07 22:11:52,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-02-07 22:11:52,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:52,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:52,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:52,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660260585] [2025-02-07 22:11:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660260585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:52,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:52,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78167433] [2025-02-07 22:11:52,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:52,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:52,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:52,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:52,787 INFO L87 Difference]: Start difference. First operand 1482 states and 2209 transitions. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:53,444 INFO L93 Difference]: Finished difference Result 2703 states and 4027 transitions. [2025-02-07 22:11:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 452 [2025-02-07 22:11:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:53,448 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:53,449 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:53,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:53,450 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 4101 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:53,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 3463 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4884353741496599) internal successors, (2188), 1470 states have internal predecessors, (2188), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2208 transitions. [2025-02-07 22:11:53,467 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2208 transitions. Word has length 452 [2025-02-07 22:11:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2208 transitions. [2025-02-07 22:11:53,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2208 transitions. [2025-02-07 22:11:53,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-02-07 22:11:53,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:53,470 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:53,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:11:53,470 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:53,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1109074028, now seen corresponding path program 1 times [2025-02-07 22:11:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318730382] [2025-02-07 22:11:53,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:53,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-02-07 22:11:53,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-02-07 22:11:53,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:53,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318730382] [2025-02-07 22:11:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318730382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969315239] [2025-02-07 22:11:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:53,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:53,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:53,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:53,932 INFO L87 Difference]: Start difference. First operand 1482 states and 2208 transitions. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:54,531 INFO L93 Difference]: Finished difference Result 2703 states and 4025 transitions. [2025-02-07 22:11:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 453 [2025-02-07 22:11:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:54,535 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:54,536 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:54,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:54,537 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 4093 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4103 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:54,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4103 Valid, 3463 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:54,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4877551020408164) internal successors, (2187), 1470 states have internal predecessors, (2187), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2207 transitions. [2025-02-07 22:11:54,558 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2207 transitions. Word has length 453 [2025-02-07 22:11:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:54,558 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2207 transitions. [2025-02-07 22:11:54,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2207 transitions. [2025-02-07 22:11:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-02-07 22:11:54,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:54,561 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:54,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:11:54,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:54,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1147540422, now seen corresponding path program 1 times [2025-02-07 22:11:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:54,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58293739] [2025-02-07 22:11:54,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:54,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-02-07 22:11:54,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-02-07 22:11:54,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:54,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58293739] [2025-02-07 22:11:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58293739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229216796] [2025-02-07 22:11:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:55,071 INFO L87 Difference]: Start difference. First operand 1482 states and 2207 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:55,683 INFO L93 Difference]: Finished difference Result 2703 states and 4023 transitions. [2025-02-07 22:11:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:55,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 454 [2025-02-07 22:11:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:55,691 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:55,691 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:55,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:55,694 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 2130 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2140 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:55,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2140 Valid, 3476 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4870748299319727) internal successors, (2186), 1470 states have internal predecessors, (2186), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2206 transitions. [2025-02-07 22:11:55,735 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2206 transitions. Word has length 454 [2025-02-07 22:11:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:55,736 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2206 transitions. [2025-02-07 22:11:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2206 transitions. [2025-02-07 22:11:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-02-07 22:11:55,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:55,738 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:55,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:11:55,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:55,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 900412974, now seen corresponding path program 1 times [2025-02-07 22:11:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095808201] [2025-02-07 22:11:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:55,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-02-07 22:11:55,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-02-07 22:11:55,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:55,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:56,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095808201] [2025-02-07 22:11:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095808201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:56,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653752624] [2025-02-07 22:11:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:56,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:56,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:56,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:56,240 INFO L87 Difference]: Start difference. First operand 1482 states and 2206 transitions. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:56,872 INFO L93 Difference]: Finished difference Result 2703 states and 4021 transitions. [2025-02-07 22:11:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:56,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 455 [2025-02-07 22:11:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:56,877 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:56,877 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:56,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:56,878 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 3999 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4009 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:56,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4009 Valid, 3463 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4863945578231292) internal successors, (2185), 1470 states have internal predecessors, (2185), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2205 transitions. [2025-02-07 22:11:56,894 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2205 transitions. Word has length 455 [2025-02-07 22:11:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:56,895 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2205 transitions. [2025-02-07 22:11:56,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2205 transitions. [2025-02-07 22:11:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-02-07 22:11:56,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:56,897 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:56,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:11:56,897 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:56,898 INFO L85 PathProgramCache]: Analyzing trace with hash 927631883, now seen corresponding path program 1 times [2025-02-07 22:11:56,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:56,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500893556] [2025-02-07 22:11:56,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:56,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-02-07 22:11:57,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-02-07 22:11:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:57,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:57,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:57,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500893556] [2025-02-07 22:11:57,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500893556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:57,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:57,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:57,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581544878] [2025-02-07 22:11:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:57,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:57,379 INFO L87 Difference]: Start difference. First operand 1482 states and 2205 transitions. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:57,987 INFO L93 Difference]: Finished difference Result 2703 states and 4019 transitions. [2025-02-07 22:11:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:57,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 456 [2025-02-07 22:11:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:57,991 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:57,992 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:57,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:57,993 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 2122 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:57,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 3476 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4857142857142858) internal successors, (2184), 1470 states have internal predecessors, (2184), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2204 transitions. [2025-02-07 22:11:58,009 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2204 transitions. Word has length 456 [2025-02-07 22:11:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:58,009 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2204 transitions. [2025-02-07 22:11:58,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2204 transitions. [2025-02-07 22:11:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-07 22:11:58,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:58,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:11:58,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:58,013 INFO L85 PathProgramCache]: Analyzing trace with hash -102143917, now seen corresponding path program 1 times [2025-02-07 22:11:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308643043] [2025-02-07 22:11:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:58,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-07 22:11:58,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-07 22:11:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308643043] [2025-02-07 22:11:58,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308643043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:58,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:58,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615522118] [2025-02-07 22:11:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:58,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:58,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:58,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:58,551 INFO L87 Difference]: Start difference. First operand 1482 states and 2204 transitions. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:59,157 INFO L93 Difference]: Finished difference Result 2703 states and 4017 transitions. [2025-02-07 22:11:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:11:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 457 [2025-02-07 22:11:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:59,161 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:11:59,161 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:11:59,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:59,164 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 3983 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3993 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:59,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3993 Valid, 3463 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:11:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:11:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.485034013605442) internal successors, (2183), 1470 states have internal predecessors, (2183), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:11:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2203 transitions. [2025-02-07 22:11:59,186 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2203 transitions. Word has length 457 [2025-02-07 22:11:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:59,187 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2203 transitions. [2025-02-07 22:11:59,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:11:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2203 transitions. [2025-02-07 22:11:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-02-07 22:11:59,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:59,194 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:11:59,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:11:59,194 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:59,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:59,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1886394672, now seen corresponding path program 1 times [2025-02-07 22:11:59,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:59,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462804534] [2025-02-07 22:11:59,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:59,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:59,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-02-07 22:11:59,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-02-07 22:11:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:11:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462804534] [2025-02-07 22:11:59,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462804534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:59,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:59,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328716842] [2025-02-07 22:11:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:59,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:59,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:59,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:59,784 INFO L87 Difference]: Start difference. First operand 1482 states and 2203 transitions. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:00,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:00,375 INFO L93 Difference]: Finished difference Result 2703 states and 4015 transitions. [2025-02-07 22:12:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 458 [2025-02-07 22:12:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:00,379 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:00,379 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:00,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:00,380 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 3897 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3907 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:00,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3907 Valid, 3463 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4843537414965986) internal successors, (2182), 1470 states have internal predecessors, (2182), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2202 transitions. [2025-02-07 22:12:00,398 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2202 transitions. Word has length 458 [2025-02-07 22:12:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:00,399 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2202 transitions. [2025-02-07 22:12:00,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2202 transitions. [2025-02-07 22:12:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-02-07 22:12:00,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:00,406 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:00,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:12:00,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:00,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:00,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1632551, now seen corresponding path program 1 times [2025-02-07 22:12:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965834014] [2025-02-07 22:12:00,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:00,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-02-07 22:12:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-02-07 22:12:00,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:00,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965834014] [2025-02-07 22:12:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965834014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:01,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:01,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309935496] [2025-02-07 22:12:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:01,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:01,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:01,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:01,066 INFO L87 Difference]: Start difference. First operand 1482 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:01,556 INFO L93 Difference]: Finished difference Result 2703 states and 4013 transitions. [2025-02-07 22:12:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:01,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 459 [2025-02-07 22:12:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:01,560 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:01,560 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:01,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:01,561 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 3889 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3899 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:01,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3899 Valid, 3463 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4836734693877551) internal successors, (2181), 1470 states have internal predecessors, (2181), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2201 transitions. [2025-02-07 22:12:01,576 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2201 transitions. Word has length 459 [2025-02-07 22:12:01,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:01,576 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2201 transitions. [2025-02-07 22:12:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2201 transitions. [2025-02-07 22:12:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-02-07 22:12:01,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:01,579 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:01,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:12:01,579 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:01,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash 943139147, now seen corresponding path program 1 times [2025-02-07 22:12:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567961279] [2025-02-07 22:12:01,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:01,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:01,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-02-07 22:12:01,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-02-07 22:12:01,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:01,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567961279] [2025-02-07 22:12:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567961279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539797602] [2025-02-07 22:12:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:02,065 INFO L87 Difference]: Start difference. First operand 1482 states and 2201 transitions. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:02,597 INFO L93 Difference]: Finished difference Result 2703 states and 4011 transitions. [2025-02-07 22:12:02,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 460 [2025-02-07 22:12:02,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:02,602 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:02,602 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:02,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:02,603 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 3881 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3891 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:02,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3891 Valid, 3463 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4829931972789117) internal successors, (2180), 1470 states have internal predecessors, (2180), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2200 transitions. [2025-02-07 22:12:02,615 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2200 transitions. Word has length 460 [2025-02-07 22:12:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:02,615 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2200 transitions. [2025-02-07 22:12:02,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2200 transitions. [2025-02-07 22:12:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-07 22:12:02,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:02,617 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:02,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:12:02,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:02,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1708048076, now seen corresponding path program 1 times [2025-02-07 22:12:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485730401] [2025-02-07 22:12:02,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:02,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-07 22:12:02,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-07 22:12:02,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:02,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:03,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485730401] [2025-02-07 22:12:03,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485730401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:03,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960129607] [2025-02-07 22:12:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:03,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:03,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:03,154 INFO L87 Difference]: Start difference. First operand 1482 states and 2200 transitions. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:03,682 INFO L93 Difference]: Finished difference Result 2703 states and 4009 transitions. [2025-02-07 22:12:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 461 [2025-02-07 22:12:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:03,689 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:03,689 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:03,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:03,690 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 2063 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:03,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 3476 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.482312925170068) internal successors, (2179), 1470 states have internal predecessors, (2179), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2199 transitions. [2025-02-07 22:12:03,708 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2199 transitions. Word has length 461 [2025-02-07 22:12:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:03,712 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2199 transitions. [2025-02-07 22:12:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2199 transitions. [2025-02-07 22:12:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-02-07 22:12:03,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:03,715 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:03,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:12:03,715 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:03,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:03,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2091928902, now seen corresponding path program 1 times [2025-02-07 22:12:03,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:03,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781935829] [2025-02-07 22:12:03,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:03,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:03,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-02-07 22:12:03,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-02-07 22:12:03,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:03,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:04,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781935829] [2025-02-07 22:12:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781935829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:12:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548616568] [2025-02-07 22:12:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:04,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:12:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:12:04,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:12:04,478 INFO L87 Difference]: Start difference. First operand 1482 states and 2199 transitions. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:04,992 INFO L93 Difference]: Finished difference Result 2703 states and 4007 transitions. [2025-02-07 22:12:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:04,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 462 [2025-02-07 22:12:04,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:04,995 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:04,996 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:04,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:04,997 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 1823 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1823 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:04,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1823 Valid, 3525 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:05,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.480952380952381) internal successors, (2177), 1470 states have internal predecessors, (2177), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2197 transitions. [2025-02-07 22:12:05,019 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2197 transitions. Word has length 462 [2025-02-07 22:12:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:05,023 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2197 transitions. [2025-02-07 22:12:05,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2197 transitions. [2025-02-07 22:12:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-02-07 22:12:05,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:05,026 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:05,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:12:05,026 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:05,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1337192698, now seen corresponding path program 1 times [2025-02-07 22:12:05,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:05,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031755615] [2025-02-07 22:12:05,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:05,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:05,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-02-07 22:12:05,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-02-07 22:12:05,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:05,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:05,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031755615] [2025-02-07 22:12:05,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031755615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:05,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:05,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:05,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267846720] [2025-02-07 22:12:05,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:05,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:05,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:05,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:05,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:05,708 INFO L87 Difference]: Start difference. First operand 1482 states and 2197 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:06,319 INFO L93 Difference]: Finished difference Result 2875 states and 4250 transitions. [2025-02-07 22:12:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 464 [2025-02-07 22:12:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:06,322 INFO L225 Difference]: With dead ends: 2875 [2025-02-07 22:12:06,322 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:06,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:12:06,323 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 2306 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2306 SdHoareTripleChecker+Valid, 5402 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:06,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2306 Valid, 5402 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:06,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4802721088435373) internal successors, (2176), 1470 states have internal predecessors, (2176), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2196 transitions. [2025-02-07 22:12:06,337 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2196 transitions. Word has length 464 [2025-02-07 22:12:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:06,338 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2196 transitions. [2025-02-07 22:12:06,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2196 transitions. [2025-02-07 22:12:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-02-07 22:12:06,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:06,340 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:06,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:12:06,340 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:06,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1611875207, now seen corresponding path program 1 times [2025-02-07 22:12:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:06,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79178174] [2025-02-07 22:12:06,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:06,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-07 22:12:06,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-07 22:12:06,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:06,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:06,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79178174] [2025-02-07 22:12:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79178174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:06,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298793319] [2025-02-07 22:12:06,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:06,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:06,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:06,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:06,876 INFO L87 Difference]: Start difference. First operand 1482 states and 2196 transitions. Second operand has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:07,396 INFO L93 Difference]: Finished difference Result 2703 states and 4001 transitions. [2025-02-07 22:12:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:07,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 465 [2025-02-07 22:12:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:07,399 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:07,399 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:07,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:07,401 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 2167 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2177 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:07,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2177 Valid, 3540 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4795918367346939) internal successors, (2175), 1470 states have internal predecessors, (2175), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2195 transitions. [2025-02-07 22:12:07,415 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2195 transitions. Word has length 465 [2025-02-07 22:12:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2195 transitions. [2025-02-07 22:12:07,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.6) internal successors, (418), 5 states have internal predecessors, (418), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2195 transitions. [2025-02-07 22:12:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-07 22:12:07,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:07,418 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:12:07,418 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:07,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1572758721, now seen corresponding path program 1 times [2025-02-07 22:12:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:07,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360374066] [2025-02-07 22:12:07,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:07,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-07 22:12:07,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-07 22:12:07,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:07,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:07,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:07,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360374066] [2025-02-07 22:12:07,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360374066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:07,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:07,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962153279] [2025-02-07 22:12:07,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:07,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:07,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:07,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:07,970 INFO L87 Difference]: Start difference. First operand 1482 states and 2195 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:08,493 INFO L93 Difference]: Finished difference Result 2703 states and 3999 transitions. [2025-02-07 22:12:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 466 [2025-02-07 22:12:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:08,496 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:08,496 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:08,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:08,498 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 2116 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:08,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 3538 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4789115646258504) internal successors, (2174), 1470 states have internal predecessors, (2174), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2194 transitions. [2025-02-07 22:12:08,514 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2194 transitions. Word has length 466 [2025-02-07 22:12:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:08,514 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2194 transitions. [2025-02-07 22:12:08,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2194 transitions. [2025-02-07 22:12:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-07 22:12:08,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:08,517 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:12:08,517 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:08,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2033435959, now seen corresponding path program 1 times [2025-02-07 22:12:08,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112387425] [2025-02-07 22:12:08,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:08,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:08,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-07 22:12:08,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-07 22:12:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112387425] [2025-02-07 22:12:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112387425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421673937] [2025-02-07 22:12:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:09,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:09,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:09,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:09,077 INFO L87 Difference]: Start difference. First operand 1482 states and 2194 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:09,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:09,600 INFO L93 Difference]: Finished difference Result 2703 states and 3997 transitions. [2025-02-07 22:12:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:09,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 467 [2025-02-07 22:12:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:09,603 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:09,603 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:09,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:09,604 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 3975 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3985 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:09,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3985 Valid, 3527 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.478231292517007) internal successors, (2173), 1470 states have internal predecessors, (2173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2193 transitions. [2025-02-07 22:12:09,617 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2193 transitions. Word has length 467 [2025-02-07 22:12:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2193 transitions. [2025-02-07 22:12:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2193 transitions. [2025-02-07 22:12:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-07 22:12:09,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:09,620 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:09,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:12:09,620 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:09,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1243532730, now seen corresponding path program 1 times [2025-02-07 22:12:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:09,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947836121] [2025-02-07 22:12:09,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:09,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:09,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-07 22:12:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-07 22:12:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:10,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:10,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947836121] [2025-02-07 22:12:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947836121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643472742] [2025-02-07 22:12:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:10,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:10,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:10,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:10,161 INFO L87 Difference]: Start difference. First operand 1482 states and 2193 transitions. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:10,681 INFO L93 Difference]: Finished difference Result 2703 states and 3995 transitions. [2025-02-07 22:12:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 468 [2025-02-07 22:12:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:10,684 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:10,684 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:10,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:10,686 INFO L435 NwaCegarLoop]: 1763 mSDtfsCounter, 2057 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2067 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:10,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2067 Valid, 3540 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4775510204081632) internal successors, (2172), 1470 states have internal predecessors, (2172), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2192 transitions. [2025-02-07 22:12:10,698 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2192 transitions. Word has length 468 [2025-02-07 22:12:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2192 transitions. [2025-02-07 22:12:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2192 transitions. [2025-02-07 22:12:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-07 22:12:10,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:10,701 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:10,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:12:10,701 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:10,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1351189836, now seen corresponding path program 1 times [2025-02-07 22:12:10,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:10,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334355500] [2025-02-07 22:12:10,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:10,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:10,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-07 22:12:11,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-07 22:12:11,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:11,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:11,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334355500] [2025-02-07 22:12:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334355500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:12:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281192324] [2025-02-07 22:12:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:11,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:12:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:11,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:12:11,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:12:11,570 INFO L87 Difference]: Start difference. First operand 1482 states and 2192 transitions. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:12,073 INFO L93 Difference]: Finished difference Result 2703 states and 3993 transitions. [2025-02-07 22:12:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:12,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 469 [2025-02-07 22:12:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:12,076 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:12,076 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:12,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:12,077 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 1918 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1918 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:12,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1918 Valid, 3525 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:12,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4768707482993197) internal successors, (2171), 1470 states have internal predecessors, (2171), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2191 transitions. [2025-02-07 22:12:12,093 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2191 transitions. Word has length 469 [2025-02-07 22:12:12,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:12,093 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2191 transitions. [2025-02-07 22:12:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2191 transitions. [2025-02-07 22:12:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-02-07 22:12:12,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:12,097 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:12,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:12:12,098 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:12,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash 583007808, now seen corresponding path program 1 times [2025-02-07 22:12:12,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:12,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815398346] [2025-02-07 22:12:12,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:12,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:12,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-02-07 22:12:12,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-02-07 22:12:12,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:13,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815398346] [2025-02-07 22:12:13,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815398346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:13,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:13,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:12:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080737647] [2025-02-07 22:12:13,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:13,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:12:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:13,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:12:13,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:12:13,028 INFO L87 Difference]: Start difference. First operand 1482 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:13,490 INFO L93 Difference]: Finished difference Result 2703 states and 3991 transitions. [2025-02-07 22:12:13,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:13,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 470 [2025-02-07 22:12:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:13,493 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:13,493 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:13,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:13,494 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 1863 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:13,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1863 Valid, 3525 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 22:12:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4761904761904763) internal successors, (2170), 1470 states have internal predecessors, (2170), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2190 transitions. [2025-02-07 22:12:13,505 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2190 transitions. Word has length 470 [2025-02-07 22:12:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2190 transitions. [2025-02-07 22:12:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2190 transitions. [2025-02-07 22:12:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-02-07 22:12:13,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:13,508 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:13,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:12:13,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:13,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1104097813, now seen corresponding path program 1 times [2025-02-07 22:12:13,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678669079] [2025-02-07 22:12:13,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-02-07 22:12:14,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-02-07 22:12:14,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:14,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:14,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678669079] [2025-02-07 22:12:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678669079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:14,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:14,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:14,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392356771] [2025-02-07 22:12:14,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:14,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:14,822 INFO L87 Difference]: Start difference. First operand 1482 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:15,538 INFO L93 Difference]: Finished difference Result 2703 states and 3989 transitions. [2025-02-07 22:12:15,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:15,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 471 [2025-02-07 22:12:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:15,541 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:15,541 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:15,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:15,542 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 1910 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 5155 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:15,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 5155 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:12:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4755102040816326) internal successors, (2169), 1470 states have internal predecessors, (2169), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2189 transitions. [2025-02-07 22:12:15,554 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2189 transitions. Word has length 471 [2025-02-07 22:12:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:15,556 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2189 transitions. [2025-02-07 22:12:15,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.8) internal successors, (424), 5 states have internal predecessors, (424), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2189 transitions. [2025-02-07 22:12:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-07 22:12:15,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:15,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:15,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:12:15,558 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -179701843, now seen corresponding path program 1 times [2025-02-07 22:12:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:15,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463314457] [2025-02-07 22:12:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:15,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-07 22:12:16,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-07 22:12:16,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463314457] [2025-02-07 22:12:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463314457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:16,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:16,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910853382] [2025-02-07 22:12:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:16,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:16,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:16,521 INFO L87 Difference]: Start difference. First operand 1482 states and 2189 transitions. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:17,081 INFO L93 Difference]: Finished difference Result 2703 states and 3987 transitions. [2025-02-07 22:12:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 472 [2025-02-07 22:12:17,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:17,084 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:17,084 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:17,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:17,089 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 1907 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:17,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 3458 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.474829931972789) internal successors, (2168), 1470 states have internal predecessors, (2168), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2188 transitions. [2025-02-07 22:12:17,101 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2188 transitions. Word has length 472 [2025-02-07 22:12:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:17,102 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2188 transitions. [2025-02-07 22:12:17,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2188 transitions. [2025-02-07 22:12:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-07 22:12:17,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:17,105 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:12:17,105 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:17,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1669614514, now seen corresponding path program 1 times [2025-02-07 22:12:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013309860] [2025-02-07 22:12:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:17,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-07 22:12:17,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-07 22:12:17,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:17,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013309860] [2025-02-07 22:12:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013309860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:18,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32327162] [2025-02-07 22:12:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:18,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:18,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:18,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:18,096 INFO L87 Difference]: Start difference. First operand 1482 states and 2188 transitions. Second operand has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:18,652 INFO L93 Difference]: Finished difference Result 2703 states and 3985 transitions. [2025-02-07 22:12:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 473 [2025-02-07 22:12:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:18,654 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:18,654 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:18,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:18,656 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 3804 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3804 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:18,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3804 Valid, 3445 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:12:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4741496598639456) internal successors, (2167), 1470 states have internal predecessors, (2167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2187 transitions. [2025-02-07 22:12:18,671 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2187 transitions. Word has length 473 [2025-02-07 22:12:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:18,671 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2187 transitions. [2025-02-07 22:12:18,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.2) internal successors, (426), 5 states have internal predecessors, (426), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2187 transitions. [2025-02-07 22:12:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-07 22:12:18,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:18,673 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:18,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:12:18,674 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:18,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1763165023, now seen corresponding path program 1 times [2025-02-07 22:12:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:18,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839789541] [2025-02-07 22:12:18,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:18,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-07 22:12:19,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-07 22:12:19,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:19,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:19,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839789541] [2025-02-07 22:12:19,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839789541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:19,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:19,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:19,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296740773] [2025-02-07 22:12:19,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:19,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:19,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:19,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:19,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:19,630 INFO L87 Difference]: Start difference. First operand 1482 states and 2187 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:20,284 INFO L93 Difference]: Finished difference Result 2703 states and 3983 transitions. [2025-02-07 22:12:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:20,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 474 [2025-02-07 22:12:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:20,290 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:20,290 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:20,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:20,292 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 1905 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:20,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 3458 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.473469387755102) internal successors, (2166), 1470 states have internal predecessors, (2166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2186 transitions. [2025-02-07 22:12:20,321 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2186 transitions. Word has length 474 [2025-02-07 22:12:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:20,321 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2186 transitions. [2025-02-07 22:12:20,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2186 transitions. [2025-02-07 22:12:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-07 22:12:20,326 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:20,327 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:20,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:12:20,327 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1744692519, now seen corresponding path program 1 times [2025-02-07 22:12:20,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:20,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613929433] [2025-02-07 22:12:20,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:20,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-07 22:12:21,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-07 22:12:21,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:21,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613929433] [2025-02-07 22:12:21,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613929433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:21,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:21,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166131082] [2025-02-07 22:12:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:21,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:21,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:21,698 INFO L87 Difference]: Start difference. First operand 1482 states and 2186 transitions. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:22,361 INFO L93 Difference]: Finished difference Result 2703 states and 3981 transitions. [2025-02-07 22:12:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:22,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 475 [2025-02-07 22:12:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:22,364 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:22,364 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:22,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:22,365 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 1904 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 3458 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:22,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 3458 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4727891156462585) internal successors, (2165), 1470 states have internal predecessors, (2165), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2185 transitions. [2025-02-07 22:12:22,382 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2185 transitions. Word has length 475 [2025-02-07 22:12:22,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:22,383 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2185 transitions. [2025-02-07 22:12:22,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2185 transitions. [2025-02-07 22:12:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-07 22:12:22,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:22,387 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:22,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:12:22,387 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:22,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1770035652, now seen corresponding path program 1 times [2025-02-07 22:12:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:22,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534309478] [2025-02-07 22:12:22,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:22,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-07 22:12:22,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-07 22:12:22,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:22,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534309478] [2025-02-07 22:12:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534309478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:12:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281709689] [2025-02-07 22:12:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:12:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:23,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:12:23,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:12:23,187 INFO L87 Difference]: Start difference. First operand 1482 states and 2185 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-07 22:12:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:24,014 INFO L93 Difference]: Finished difference Result 2723 states and 4008 transitions. [2025-02-07 22:12:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 476 [2025-02-07 22:12:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:24,017 INFO L225 Difference]: With dead ends: 2723 [2025-02-07 22:12:24,017 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:24,018 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 22:12:24,019 INFO L435 NwaCegarLoop]: 1815 mSDtfsCounter, 14 mSDsluCounter, 3198 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:24,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5013 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:12:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.472108843537415) internal successors, (2164), 1470 states have internal predecessors, (2164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2184 transitions. [2025-02-07 22:12:24,031 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2184 transitions. Word has length 476 [2025-02-07 22:12:24,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:24,032 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2184 transitions. [2025-02-07 22:12:24,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-07 22:12:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2184 transitions. [2025-02-07 22:12:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-07 22:12:24,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:24,034 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:12:24,034 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:24,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1845651703, now seen corresponding path program 1 times [2025-02-07 22:12:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461802256] [2025-02-07 22:12:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:24,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-07 22:12:24,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-07 22:12:24,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:24,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:25,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:25,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461802256] [2025-02-07 22:12:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461802256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451052100] [2025-02-07 22:12:25,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:25,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:25,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:25,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:25,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:25,031 INFO L87 Difference]: Start difference. First operand 1482 states and 2184 transitions. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:25,682 INFO L93 Difference]: Finished difference Result 2703 states and 3977 transitions. [2025-02-07 22:12:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:25,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 477 [2025-02-07 22:12:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:25,685 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:25,685 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:25,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:25,686 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 1901 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:25,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 3456 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:25,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4714285714285715) internal successors, (2163), 1470 states have internal predecessors, (2163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2183 transitions. [2025-02-07 22:12:25,699 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2183 transitions. Word has length 477 [2025-02-07 22:12:25,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:25,699 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2183 transitions. [2025-02-07 22:12:25,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2183 transitions. [2025-02-07 22:12:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-07 22:12:25,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:25,701 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:12:25,701 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash -7242201, now seen corresponding path program 1 times [2025-02-07 22:12:25,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:25,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253519707] [2025-02-07 22:12:25,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:25,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:25,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-07 22:12:26,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-07 22:12:26,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:26,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:26,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:26,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253519707] [2025-02-07 22:12:26,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253519707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:26,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:26,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:26,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191071185] [2025-02-07 22:12:26,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:26,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:26,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:26,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:26,619 INFO L87 Difference]: Start difference. First operand 1482 states and 2183 transitions. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:27,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:27,273 INFO L93 Difference]: Finished difference Result 2703 states and 3975 transitions. [2025-02-07 22:12:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:27,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 478 [2025-02-07 22:12:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:27,275 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:27,275 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:27,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:27,277 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 3686 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:27,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3686 Valid, 3443 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4707482993197278) internal successors, (2162), 1470 states have internal predecessors, (2162), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2182 transitions. [2025-02-07 22:12:27,290 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2182 transitions. Word has length 478 [2025-02-07 22:12:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2182 transitions. [2025-02-07 22:12:27,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2182 transitions. [2025-02-07 22:12:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-07 22:12:27,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:27,292 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:27,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:12:27,293 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:27,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash -697387806, now seen corresponding path program 1 times [2025-02-07 22:12:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342726017] [2025-02-07 22:12:27,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:27,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-07 22:12:27,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-07 22:12:27,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:28,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342726017] [2025-02-07 22:12:28,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342726017] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:28,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:28,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:28,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993715611] [2025-02-07 22:12:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:28,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:28,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:28,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:28,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:28,178 INFO L87 Difference]: Start difference. First operand 1482 states and 2182 transitions. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:28,828 INFO L93 Difference]: Finished difference Result 2703 states and 3973 transitions. [2025-02-07 22:12:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 479 [2025-02-07 22:12:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:28,831 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:28,831 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:28,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:28,832 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 1899 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1899 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:28,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1899 Valid, 3456 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.4700680272108844) internal successors, (2161), 1470 states have internal predecessors, (2161), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2181 transitions. [2025-02-07 22:12:28,845 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2181 transitions. Word has length 479 [2025-02-07 22:12:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2181 transitions. [2025-02-07 22:12:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2181 transitions. [2025-02-07 22:12:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-07 22:12:28,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:28,847 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:12:28,847 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1012632906, now seen corresponding path program 1 times [2025-02-07 22:12:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705126275] [2025-02-07 22:12:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:28,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-07 22:12:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-07 22:12:29,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:29,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705126275] [2025-02-07 22:12:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705126275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332492689] [2025-02-07 22:12:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:29,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:29,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:29,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:29,790 INFO L87 Difference]: Start difference. First operand 1482 states and 2181 transitions. Second operand has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:30,435 INFO L93 Difference]: Finished difference Result 2703 states and 3971 transitions. [2025-02-07 22:12:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:12:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 480 [2025-02-07 22:12:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:30,437 INFO L225 Difference]: With dead ends: 2703 [2025-02-07 22:12:30,437 INFO L226 Difference]: Without dead ends: 1482 [2025-02-07 22:12:30,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:30,438 INFO L435 NwaCegarLoop]: 1721 mSDtfsCounter, 3674 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3674 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:30,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3674 Valid, 3443 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-02-07 22:12:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1482. [2025-02-07 22:12:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 1470 states have (on average 1.469387755102041) internal successors, (2160), 1470 states have internal predecessors, (2160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2180 transitions. [2025-02-07 22:12:30,451 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2180 transitions. Word has length 480 [2025-02-07 22:12:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:30,451 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 2180 transitions. [2025-02-07 22:12:30,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.6) internal successors, (433), 5 states have internal predecessors, (433), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2180 transitions. [2025-02-07 22:12:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-07 22:12:30,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:30,454 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:30,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 22:12:30,454 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:30,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash 245589170, now seen corresponding path program 1 times [2025-02-07 22:12:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:30,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123587636] [2025-02-07 22:12:30,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:30,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-07 22:12:31,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-07 22:12:31,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123587636] [2025-02-07 22:12:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123587636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290803621] [2025-02-07 22:12:32,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:32,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:32,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:32,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:32,315 INFO L87 Difference]: Start difference. First operand 1482 states and 2180 transitions. Second operand has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:33,320 INFO L93 Difference]: Finished difference Result 2999 states and 4380 transitions. [2025-02-07 22:12:33,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 481 [2025-02-07 22:12:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:33,323 INFO L225 Difference]: With dead ends: 2999 [2025-02-07 22:12:33,323 INFO L226 Difference]: Without dead ends: 1778 [2025-02-07 22:12:33,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:33,324 INFO L435 NwaCegarLoop]: 1809 mSDtfsCounter, 228 mSDsluCounter, 5419 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 7228 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:33,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 7228 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:12:33,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2025-02-07 22:12:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1776. [2025-02-07 22:12:33,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1764 states have (on average 1.4552154195011338) internal successors, (2567), 1764 states have internal predecessors, (2567), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2587 transitions. [2025-02-07 22:12:33,343 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2587 transitions. Word has length 481 [2025-02-07 22:12:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:33,343 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2587 transitions. [2025-02-07 22:12:33,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:33,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2587 transitions. [2025-02-07 22:12:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-07 22:12:33,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:33,345 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:33,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 22:12:33,345 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:33,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 628839361, now seen corresponding path program 1 times [2025-02-07 22:12:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883303701] [2025-02-07 22:12:33,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:33,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-07 22:12:33,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-07 22:12:33,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883303701] [2025-02-07 22:12:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883303701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:12:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424294049] [2025-02-07 22:12:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:12:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:33,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:12:33,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:12:33,948 INFO L87 Difference]: Start difference. First operand 1776 states and 2587 transitions. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:34,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:34,622 INFO L93 Difference]: Finished difference Result 3309 states and 4810 transitions. [2025-02-07 22:12:34,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:34,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 482 [2025-02-07 22:12:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:34,624 INFO L225 Difference]: With dead ends: 3309 [2025-02-07 22:12:34,624 INFO L226 Difference]: Without dead ends: 1794 [2025-02-07 22:12:34,625 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 22:12:34,626 INFO L435 NwaCegarLoop]: 1811 mSDtfsCounter, 16 mSDsluCounter, 7229 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9040 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:34,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9040 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:12:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2025-02-07 22:12:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1794. [2025-02-07 22:12:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1782 states have (on average 1.4551066217732884) internal successors, (2593), 1782 states have internal predecessors, (2593), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2613 transitions. [2025-02-07 22:12:34,648 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2613 transitions. Word has length 482 [2025-02-07 22:12:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:34,649 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2613 transitions. [2025-02-07 22:12:34,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-07 22:12:34,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2613 transitions. [2025-02-07 22:12:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-07 22:12:34,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:34,651 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:34,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 22:12:34,652 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:34,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:34,652 INFO L85 PathProgramCache]: Analyzing trace with hash 911693385, now seen corresponding path program 1 times [2025-02-07 22:12:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846983905] [2025-02-07 22:12:34,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:34,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-07 22:12:35,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-07 22:12:35,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:35,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:36,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:36,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846983905] [2025-02-07 22:12:36,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846983905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:36,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:36,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 22:12:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499330384] [2025-02-07 22:12:36,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:36,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 22:12:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:36,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 22:12:36,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:12:36,318 INFO L87 Difference]: Start difference. First operand 1794 states and 2613 transitions. Second operand has 9 states, 9 states have (on average 48.333333333333336) internal successors, (435), 9 states have internal predecessors, (435), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:38,532 INFO L93 Difference]: Finished difference Result 3339 states and 4853 transitions. [2025-02-07 22:12:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 22:12:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 48.333333333333336) internal successors, (435), 9 states have internal predecessors, (435), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 482 [2025-02-07 22:12:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:38,534 INFO L225 Difference]: With dead ends: 3339 [2025-02-07 22:12:38,536 INFO L226 Difference]: Without dead ends: 1806 [2025-02-07 22:12:38,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:12:38,537 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 2161 mSDsluCounter, 8134 mSDsCounter, 0 mSdLazyCounter, 5684 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2171 SdHoareTripleChecker+Valid, 9508 SdHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:38,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2171 Valid, 9508 Invalid, 5687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5684 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-07 22:12:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2025-02-07 22:12:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1802. [2025-02-07 22:12:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1790 states have (on average 1.4547486033519552) internal successors, (2604), 1790 states have internal predecessors, (2604), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2624 transitions. [2025-02-07 22:12:38,561 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2624 transitions. Word has length 482 [2025-02-07 22:12:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2624 transitions. [2025-02-07 22:12:38,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 48.333333333333336) internal successors, (435), 9 states have internal predecessors, (435), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2624 transitions. [2025-02-07 22:12:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-07 22:12:38,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:38,564 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:38,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 22:12:38,564 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash -724618080, now seen corresponding path program 1 times [2025-02-07 22:12:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512316077] [2025-02-07 22:12:38,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:38,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-07 22:12:38,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-07 22:12:38,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:38,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:39,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:39,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512316077] [2025-02-07 22:12:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512316077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:39,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:39,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394174044] [2025-02-07 22:12:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:39,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:39,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:39,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:39,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:39,215 INFO L87 Difference]: Start difference. First operand 1802 states and 2624 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:40,217 INFO L93 Difference]: Finished difference Result 3345 states and 4860 transitions. [2025-02-07 22:12:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 483 [2025-02-07 22:12:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:40,219 INFO L225 Difference]: With dead ends: 3345 [2025-02-07 22:12:40,219 INFO L226 Difference]: Without dead ends: 1804 [2025-02-07 22:12:40,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:40,221 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 2149 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:40,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 4106 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:12:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2025-02-07 22:12:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2025-02-07 22:12:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1792 states have (on average 1.4542410714285714) internal successors, (2606), 1792 states have internal predecessors, (2606), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:40,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2626 transitions. [2025-02-07 22:12:40,241 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2626 transitions. Word has length 483 [2025-02-07 22:12:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:40,241 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2626 transitions. [2025-02-07 22:12:40,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2626 transitions. [2025-02-07 22:12:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-02-07 22:12:40,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:40,244 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:40,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 22:12:40,244 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:40,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1884841745, now seen corresponding path program 1 times [2025-02-07 22:12:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:40,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901329061] [2025-02-07 22:12:40,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:40,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-02-07 22:12:40,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-02-07 22:12:40,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:40,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:41,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901329061] [2025-02-07 22:12:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901329061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171373367] [2025-02-07 22:12:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:41,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:41,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:41,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:41,985 INFO L87 Difference]: Start difference. First operand 1804 states and 2626 transitions. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:43,093 INFO L93 Difference]: Finished difference Result 3355 states and 4873 transitions. [2025-02-07 22:12:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 483 [2025-02-07 22:12:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:43,096 INFO L225 Difference]: With dead ends: 3355 [2025-02-07 22:12:43,096 INFO L226 Difference]: Without dead ends: 1812 [2025-02-07 22:12:43,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:43,102 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 1961 mSDsluCounter, 2750 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:43,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 4132 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 22:12:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-02-07 22:12:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2025-02-07 22:12:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1796 states have (on average 1.453229398663697) internal successors, (2610), 1796 states have internal predecessors, (2610), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-07 22:12:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2630 transitions. [2025-02-07 22:12:43,140 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2630 transitions. Word has length 483 [2025-02-07 22:12:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:43,142 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2630 transitions. [2025-02-07 22:12:43,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2630 transitions. [2025-02-07 22:12:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-02-07 22:12:43,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:43,148 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 22:12:43,148 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1522654198, now seen corresponding path program 1 times [2025-02-07 22:12:43,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:43,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382200172] [2025-02-07 22:12:43,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:43,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:43,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-02-07 22:12:44,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-02-07 22:12:44,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:44,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:45,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:45,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382200172] [2025-02-07 22:12:45,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382200172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:45,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:45,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:12:45,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817689379] [2025-02-07 22:12:45,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:45,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:12:45,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:45,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:12:45,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:12:45,472 INFO L87 Difference]: Start difference. First operand 1808 states and 2630 transitions. Second operand has 8 states, 8 states have (on average 54.625) internal successors, (437), 8 states have internal predecessors, (437), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:46,591 INFO L93 Difference]: Finished difference Result 4859 states and 7046 transitions. [2025-02-07 22:12:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:12:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 54.625) internal successors, (437), 8 states have internal predecessors, (437), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 484 [2025-02-07 22:12:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:46,595 INFO L225 Difference]: With dead ends: 4859 [2025-02-07 22:12:46,595 INFO L226 Difference]: Without dead ends: 3312 [2025-02-07 22:12:46,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:12:46,597 INFO L435 NwaCegarLoop]: 1783 mSDtfsCounter, 5256 mSDsluCounter, 8855 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5269 SdHoareTripleChecker+Valid, 10638 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:46,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5269 Valid, 10638 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:12:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2025-02-07 22:12:46,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 2007. [2025-02-07 22:12:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1988 states have (on average 1.4532193158953723) internal successors, (2889), 1988 states have internal predecessors, (2889), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-07 22:12:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2923 transitions. [2025-02-07 22:12:46,624 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2923 transitions. Word has length 484 [2025-02-07 22:12:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:46,626 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 2923 transitions. [2025-02-07 22:12:46,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 54.625) internal successors, (437), 8 states have internal predecessors, (437), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2923 transitions. [2025-02-07 22:12:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-02-07 22:12:46,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:46,629 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:46,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 22:12:46,629 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:46,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1164844254, now seen corresponding path program 1 times [2025-02-07 22:12:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573664714] [2025-02-07 22:12:46,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:46,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-02-07 22:12:47,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-02-07 22:12:47,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:47,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:48,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:48,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573664714] [2025-02-07 22:12:48,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573664714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:48,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:48,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:12:48,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940864061] [2025-02-07 22:12:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:48,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:12:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:48,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:12:48,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:48,146 INFO L87 Difference]: Start difference. First operand 2007 states and 2923 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:12:49,210 INFO L93 Difference]: Finished difference Result 3562 states and 5174 transitions. [2025-02-07 22:12:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:12:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 485 [2025-02-07 22:12:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:12:49,213 INFO L225 Difference]: With dead ends: 3562 [2025-02-07 22:12:49,213 INFO L226 Difference]: Without dead ends: 2015 [2025-02-07 22:12:49,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:12:49,215 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 2077 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 4106 SdHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:12:49,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 4106 Invalid, 2409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:12:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-02-07 22:12:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 2011. [2025-02-07 22:12:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1992 states have (on average 1.4523092369477912) internal successors, (2893), 1992 states have internal predecessors, (2893), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-07 22:12:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2927 transitions. [2025-02-07 22:12:49,245 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2927 transitions. Word has length 485 [2025-02-07 22:12:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:12:49,248 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2927 transitions. [2025-02-07 22:12:49,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-07 22:12:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2927 transitions. [2025-02-07 22:12:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-07 22:12:49,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:12:49,251 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:12:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 22:12:49,251 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:12:49,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:12:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 940976347, now seen corresponding path program 1 times [2025-02-07 22:12:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:12:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38866193] [2025-02-07 22:12:49,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:12:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:12:49,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-07 22:12:49,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-07 22:12:49,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:12:49,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:12:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 22:12:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:12:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38866193] [2025-02-07 22:12:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38866193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:12:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:12:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:12:50,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670632263] [2025-02-07 22:12:50,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:12:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:12:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:12:50,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:12:50,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:12:50,991 INFO L87 Difference]: Start difference. First operand 2011 states and 2927 transitions. Second operand has 7 states, 7 states have (on average 62.714285714285715) internal successors, (439), 7 states have internal predecessors, (439), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)