./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_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_n2_w8_d8_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 bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:10:01,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:10:01,794 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:10:01,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:10:01,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:10:01,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:10:01,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:10:01,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:10:01,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:10:01,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:10:01,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:10:01,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:10:01,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:10:01,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:10:01,828 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:10:01,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:10:01,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:10:01,830 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:10:01,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:10:01,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:10:01,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:10:01,831 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 -> bc2e904f13a7fa14a7dbeef3e8e25f99c977216576e94bddd8177d4452d960d5 [2025-02-07 22:10:02,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:10:02,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:10:02,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:10:02,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:10:02,059 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:10:02,060 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_n2_w8_d8_e0.c [2025-02-07 22:10:03,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad79a310/e366b3a8dc9d483d945661004f85bc1a/FLAG4fa5f55d3 [2025-02-07 22:10:03,522 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:10:03,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2025-02-07 22:10:03,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad79a310/e366b3a8dc9d483d945661004f85bc1a/FLAG4fa5f55d3 [2025-02-07 22:10:03,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ad79a310/e366b3a8dc9d483d945661004f85bc1a [2025-02-07 22:10:03,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:10:03,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:10:03,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:10:03,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:10:03,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:10:03,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:10:03" (1/1) ... [2025-02-07 22:10:03,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:03, skipping insertion in model container [2025-02-07 22:10:03,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:10:03" (1/1) ... [2025-02-07 22:10:03,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:10:03,733 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_n2_w8_d8_e0.c[1269,1282] [2025-02-07 22:10:03,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:10:03,957 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:10:03,965 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_n2_w8_d8_e0.c[1269,1282] [2025-02-07 22:10:04,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:10:04,069 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:10:04,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04 WrapperNode [2025-02-07 22:10:04,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:10:04,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:10:04,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:10:04,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:10:04,076 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:10:04" (1/1) ... [2025-02-07 22:10:04,105 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:10:04" (1/1) ... [2025-02-07 22:10:04,320 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2622 [2025-02-07 22:10:04,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:10:04,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:10:04,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:10:04,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:10:04,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,485 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:10:04,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:10:04,655 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:10:04,655 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:10:04,655 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:10:04,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (1/1) ... [2025-02-07 22:10:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:10:04,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:10:04,688 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:10:04,690 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:10:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:10:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 22:10:04,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 22:10:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:10:04,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:10:04,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:10:04,897 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:10:04,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:10:07,095 INFO L? ?]: Removed 1450 outVars from TransFormulas that were not future-live. [2025-02-07 22:10:07,096 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:10:07,190 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:10:07,190 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 22:10:07,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:10:07 BoogieIcfgContainer [2025-02-07 22:10:07,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:10:07,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:10:07,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:10:07,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:10:07,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:10:03" (1/3) ... [2025-02-07 22:10:07,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c3fc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:10:07, skipping insertion in model container [2025-02-07 22:10:07,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:10:04" (2/3) ... [2025-02-07 22:10:07,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c3fc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:10:07, skipping insertion in model container [2025-02-07 22:10:07,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:10:07" (3/3) ... [2025-02-07 22:10:07,202 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c [2025-02-07 22:10:07,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:10:07,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n2_w8_d8_e0.c that has 2 procedures, 774 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:10:07,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:10:07,280 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;@2f1281d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:10:07,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:10:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 774 states, 764 states have (on average 1.4947643979057592) internal successors, (1142), 765 states have internal predecessors, (1142), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-07 22:10:07,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:07,304 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:07,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:07,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 608686164, now seen corresponding path program 1 times [2025-02-07 22:10:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268185405] [2025-02-07 22:10:07,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:07,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 22:10:07,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 22:10:07,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:07,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-07 22:10:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:07,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268185405] [2025-02-07 22:10:07,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268185405] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 22:10:07,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91118854] [2025-02-07 22:10:07,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:07,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 22:10:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:10:07,765 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:10:07,767 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:10:08,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 22:10:08,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 22:10:08,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:08,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 22:10:08,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 22:10:08,281 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-07 22:10:08,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 22:10:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91118854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 22:10:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-07 22:10:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566327743] [2025-02-07 22:10:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:08,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 22:10:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:08,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 22:10:08,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 22:10:08,303 INFO L87 Difference]: Start difference. First operand has 774 states, 764 states have (on average 1.4947643979057592) internal successors, (1142), 765 states have internal predecessors, (1142), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:08,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:08,524 INFO L93 Difference]: Finished difference Result 1429 states and 2143 transitions. [2025-02-07 22:10:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 22:10:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 262 [2025-02-07 22:10:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:08,537 INFO L225 Difference]: With dead ends: 1429 [2025-02-07 22:10:08,539 INFO L226 Difference]: Without dead ends: 772 [2025-02-07 22:10:08,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 263 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:10:08,546 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:08,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 965 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:10:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-02-07 22:10:08,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2025-02-07 22:10:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 763 states have (on average 1.491480996068152) internal successors, (1138), 763 states have internal predecessors, (1138), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1152 transitions. [2025-02-07 22:10:08,595 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1152 transitions. Word has length 262 [2025-02-07 22:10:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:08,595 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1152 transitions. [2025-02-07 22:10:08,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1152 transitions. [2025-02-07 22:10:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-07 22:10:08,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:08,598 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 22:10:08,803 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:10:08,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:08,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 66119597, now seen corresponding path program 1 times [2025-02-07 22:10:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417159719] [2025-02-07 22:10:08,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:08,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-07 22:10:09,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-07 22:10:09,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:09,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417159719] [2025-02-07 22:10:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417159719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:09,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:09,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:09,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890524474] [2025-02-07 22:10:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:09,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:09,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:09,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:09,908 INFO L87 Difference]: Start difference. First operand 772 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:10,260 INFO L93 Difference]: Finished difference Result 776 states and 1156 transitions. [2025-02-07 22:10:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 262 [2025-02-07 22:10:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:10,267 INFO L225 Difference]: With dead ends: 776 [2025-02-07 22:10:10,268 INFO L226 Difference]: Without dead ends: 774 [2025-02-07 22:10:10,268 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:10:10,268 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 0 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:10,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2884 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-02-07 22:10:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2025-02-07 22:10:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.4901960784313726) internal successors, (1140), 765 states have internal predecessors, (1140), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1154 transitions. [2025-02-07 22:10:10,317 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1154 transitions. Word has length 262 [2025-02-07 22:10:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:10,319 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1154 transitions. [2025-02-07 22:10:10,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1154 transitions. [2025-02-07 22:10:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-07 22:10:10,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:10,323 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:10,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:10:10,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2054387203, now seen corresponding path program 1 times [2025-02-07 22:10:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959871942] [2025-02-07 22:10:10,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:10,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:10,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-07 22:10:10,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-07 22:10:10,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:10,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959871942] [2025-02-07 22:10:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959871942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:10,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:10,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087790754] [2025-02-07 22:10:10,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:10,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:10,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:10,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:10,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:10,985 INFO L87 Difference]: Start difference. First operand 774 states and 1154 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:12,084 INFO L93 Difference]: Finished difference Result 1966 states and 2934 transitions. [2025-02-07 22:10:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:10:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 263 [2025-02-07 22:10:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:12,088 INFO L225 Difference]: With dead ends: 1966 [2025-02-07 22:10:12,088 INFO L226 Difference]: Without dead ends: 774 [2025-02-07 22:10:12,090 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:10:12,090 INFO L435 NwaCegarLoop]: 1041 mSDtfsCounter, 2208 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:12,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 2814 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:10:12,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-02-07 22:10:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2025-02-07 22:10:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.488888888888889) internal successors, (1139), 765 states have internal predecessors, (1139), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1153 transitions. [2025-02-07 22:10:12,104 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1153 transitions. Word has length 263 [2025-02-07 22:10:12,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:12,104 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1153 transitions. [2025-02-07 22:10:12,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:12,104 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1153 transitions. [2025-02-07 22:10:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-07 22:10:12,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:12,106 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:10:12,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash 426785440, now seen corresponding path program 1 times [2025-02-07 22:10:12,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:12,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326207668] [2025-02-07 22:10:12,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:12,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:12,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-07 22:10:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-07 22:10:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:12,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326207668] [2025-02-07 22:10:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326207668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573481037] [2025-02-07 22:10:12,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:12,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:12,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:12,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:12,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:12,529 INFO L87 Difference]: Start difference. First operand 774 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:13,120 INFO L93 Difference]: Finished difference Result 1431 states and 2131 transitions. [2025-02-07 22:10:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 264 [2025-02-07 22:10:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:13,123 INFO L225 Difference]: With dead ends: 1431 [2025-02-07 22:10:13,123 INFO L226 Difference]: Without dead ends: 774 [2025-02-07 22:10:13,124 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:10:13,124 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 2050 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:13,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 1423 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:10:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-02-07 22:10:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774. [2025-02-07 22:10:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 765 states have (on average 1.4875816993464053) internal successors, (1138), 765 states have internal predecessors, (1138), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1152 transitions. [2025-02-07 22:10:13,142 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1152 transitions. Word has length 264 [2025-02-07 22:10:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:13,143 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1152 transitions. [2025-02-07 22:10:13,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1152 transitions. [2025-02-07 22:10:13,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-07 22:10:13,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:13,147 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:10:13,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -30513726, now seen corresponding path program 1 times [2025-02-07 22:10:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541825716] [2025-02-07 22:10:13,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:13,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-07 22:10:13,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-07 22:10:13,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:13,718 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:13,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:13,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541825716] [2025-02-07 22:10:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541825716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:13,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230213991] [2025-02-07 22:10:13,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:13,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:13,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:13,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:13,719 INFO L87 Difference]: Start difference. First operand 774 states and 1152 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:14,003 INFO L93 Difference]: Finished difference Result 1433 states and 2132 transitions. [2025-02-07 22:10:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:14,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 265 [2025-02-07 22:10:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:14,006 INFO L225 Difference]: With dead ends: 1433 [2025-02-07 22:10:14,006 INFO L226 Difference]: Without dead ends: 776 [2025-02-07 22:10:14,007 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:10:14,007 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 0 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:14,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2875 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-02-07 22:10:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2025-02-07 22:10:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 767 states have (on average 1.4863102998696218) internal successors, (1140), 767 states have internal predecessors, (1140), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1154 transitions. [2025-02-07 22:10:14,020 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1154 transitions. Word has length 265 [2025-02-07 22:10:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1154 transitions. [2025-02-07 22:10:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1154 transitions. [2025-02-07 22:10:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-07 22:10:14,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:14,022 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:10:14,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:14,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash 985584265, now seen corresponding path program 1 times [2025-02-07 22:10:14,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:14,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221351507] [2025-02-07 22:10:14,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-07 22:10:14,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-07 22:10:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:14,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221351507] [2025-02-07 22:10:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221351507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:14,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:14,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142933596] [2025-02-07 22:10:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:14,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:14,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:14,597 INFO L87 Difference]: Start difference. First operand 776 states and 1154 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:14,939 INFO L93 Difference]: Finished difference Result 1434 states and 2132 transitions. [2025-02-07 22:10:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 266 [2025-02-07 22:10:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:14,943 INFO L225 Difference]: With dead ends: 1434 [2025-02-07 22:10:14,943 INFO L226 Difference]: Without dead ends: 775 [2025-02-07 22:10:14,944 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:10:14,944 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 986 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:14,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1839 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-07 22:10:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-07 22:10:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 766 states have (on average 1.4843342036553524) internal successors, (1137), 766 states have internal predecessors, (1137), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1151 transitions. [2025-02-07 22:10:14,960 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1151 transitions. Word has length 266 [2025-02-07 22:10:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:14,961 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1151 transitions. [2025-02-07 22:10:14,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1151 transitions. [2025-02-07 22:10:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-07 22:10:14,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:14,963 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:14,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:10:14,963 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:14,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1887392874, now seen corresponding path program 1 times [2025-02-07 22:10:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:14,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105466991] [2025-02-07 22:10:14,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:15,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-07 22:10:15,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-07 22:10:15,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:15,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:15,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:15,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105466991] [2025-02-07 22:10:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105466991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:15,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893747067] [2025-02-07 22:10:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:15,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:15,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:15,411 INFO L87 Difference]: Start difference. First operand 775 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:15,769 INFO L93 Difference]: Finished difference Result 1435 states and 2129 transitions. [2025-02-07 22:10:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:10:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 267 [2025-02-07 22:10:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:15,773 INFO L225 Difference]: With dead ends: 1435 [2025-02-07 22:10:15,773 INFO L226 Difference]: Without dead ends: 775 [2025-02-07 22:10:15,774 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:10:15,775 INFO L435 NwaCegarLoop]: 953 mSDtfsCounter, 990 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:15,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 2832 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-07 22:10:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-07 22:10:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 766 states have (on average 1.483028720626632) internal successors, (1136), 766 states have internal predecessors, (1136), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1150 transitions. [2025-02-07 22:10:15,789 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1150 transitions. Word has length 267 [2025-02-07 22:10:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1150 transitions. [2025-02-07 22:10:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1150 transitions. [2025-02-07 22:10:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-07 22:10:15,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:15,793 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:15,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:10:15,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1304217998, now seen corresponding path program 1 times [2025-02-07 22:10:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937311104] [2025-02-07 22:10:15,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:15,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-07 22:10:15,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-07 22:10:15,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:15,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937311104] [2025-02-07 22:10:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937311104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:16,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:16,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748849378] [2025-02-07 22:10:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:16,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:16,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:16,165 INFO L87 Difference]: Start difference. First operand 775 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:16,481 INFO L93 Difference]: Finished difference Result 1433 states and 2125 transitions. [2025-02-07 22:10:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 268 [2025-02-07 22:10:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:16,484 INFO L225 Difference]: With dead ends: 1433 [2025-02-07 22:10:16,484 INFO L226 Difference]: Without dead ends: 775 [2025-02-07 22:10:16,485 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:10:16,485 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 2033 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:16,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 1839 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-07 22:10:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-07 22:10:16,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 766 states have (on average 1.4817232375979112) internal successors, (1135), 766 states have internal predecessors, (1135), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1149 transitions. [2025-02-07 22:10:16,500 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1149 transitions. Word has length 268 [2025-02-07 22:10:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:16,501 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1149 transitions. [2025-02-07 22:10:16,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1149 transitions. [2025-02-07 22:10:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-07 22:10:16,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:16,503 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:10:16,503 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:16,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash 982896033, now seen corresponding path program 1 times [2025-02-07 22:10:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146020275] [2025-02-07 22:10:16,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:16,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-07 22:10:16,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-07 22:10:16,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146020275] [2025-02-07 22:10:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146020275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:16,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:16,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:16,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195973519] [2025-02-07 22:10:16,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:16,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:16,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:16,944 INFO L87 Difference]: Start difference. First operand 775 states and 1149 transitions. Second operand has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:17,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:17,475 INFO L93 Difference]: Finished difference Result 1433 states and 2123 transitions. [2025-02-07 22:10:17,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:17,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 269 [2025-02-07 22:10:17,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:17,478 INFO L225 Difference]: With dead ends: 1433 [2025-02-07 22:10:17,478 INFO L226 Difference]: Without dead ends: 775 [2025-02-07 22:10:17,479 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:10:17,480 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 1085 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:17,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1849 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:10:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-02-07 22:10:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2025-02-07 22:10:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 766 states have (on average 1.4804177545691906) internal successors, (1134), 766 states have internal predecessors, (1134), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1148 transitions. [2025-02-07 22:10:17,493 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1148 transitions. Word has length 269 [2025-02-07 22:10:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1148 transitions. [2025-02-07 22:10:17,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1148 transitions. [2025-02-07 22:10:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-07 22:10:17,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:17,496 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:10:17,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1147834999, now seen corresponding path program 1 times [2025-02-07 22:10:17,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:17,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998828352] [2025-02-07 22:10:17,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:17,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:17,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-07 22:10:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-07 22:10:17,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998828352] [2025-02-07 22:10:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998828352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:10:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134190200] [2025-02-07 22:10:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:18,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:10:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:18,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:10:18,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:10:18,812 INFO L87 Difference]: Start difference. First operand 775 states and 1148 transitions. Second operand has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:19,792 INFO L93 Difference]: Finished difference Result 1537 states and 2276 transitions. [2025-02-07 22:10:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:10:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 270 [2025-02-07 22:10:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:19,796 INFO L225 Difference]: With dead ends: 1537 [2025-02-07 22:10:19,797 INFO L226 Difference]: Without dead ends: 795 [2025-02-07 22:10:19,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:10:19,798 INFO L435 NwaCegarLoop]: 968 mSDtfsCounter, 70 mSDsluCounter, 7474 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 8442 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:19,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 8442 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 22:10:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-07 22:10:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2025-02-07 22:10:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 782 states have (on average 1.4808184143222507) internal successors, (1158), 782 states have internal predecessors, (1158), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1172 transitions. [2025-02-07 22:10:19,814 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1172 transitions. Word has length 270 [2025-02-07 22:10:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:19,814 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1172 transitions. [2025-02-07 22:10:19,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.8) internal successors, (238), 10 states have internal predecessors, (238), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1172 transitions. [2025-02-07 22:10:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-07 22:10:19,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:19,817 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:19,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:10:19,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:19,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1945544972, now seen corresponding path program 1 times [2025-02-07 22:10:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:19,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023415722] [2025-02-07 22:10:19,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:19,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:19,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-07 22:10:20,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-07 22:10:20,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:20,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023415722] [2025-02-07 22:10:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023415722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:20,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:10:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960334685] [2025-02-07 22:10:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:10:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:20,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:10:20,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:10:20,608 INFO L87 Difference]: Start difference. First operand 791 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:21,397 INFO L93 Difference]: Finished difference Result 1578 states and 2337 transitions. [2025-02-07 22:10:21,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:10:21,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 271 [2025-02-07 22:10:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:21,401 INFO L225 Difference]: With dead ends: 1578 [2025-02-07 22:10:21,401 INFO L226 Difference]: Without dead ends: 795 [2025-02-07 22:10:21,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:10:21,402 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 1282 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 4553 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:21,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 4553 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:10:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-07 22:10:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2025-02-07 22:10:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 784 states have (on average 1.4783163265306123) internal successors, (1159), 784 states have internal predecessors, (1159), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1173 transitions. [2025-02-07 22:10:21,415 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1173 transitions. Word has length 271 [2025-02-07 22:10:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1173 transitions. [2025-02-07 22:10:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.142857142857146) internal successors, (239), 7 states have internal predecessors, (239), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1173 transitions. [2025-02-07 22:10:21,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-07 22:10:21,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:21,418 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:10:21,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -401308106, now seen corresponding path program 1 times [2025-02-07 22:10:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351813289] [2025-02-07 22:10:21,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:21,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-07 22:10:21,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-07 22:10:21,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:22,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351813289] [2025-02-07 22:10:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351813289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:22,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:22,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:22,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255074801] [2025-02-07 22:10:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:22,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:22,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:22,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:22,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:22,027 INFO L87 Difference]: Start difference. First operand 793 states and 1173 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:22,632 INFO L93 Difference]: Finished difference Result 1469 states and 2171 transitions. [2025-02-07 22:10:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:22,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 272 [2025-02-07 22:10:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:22,635 INFO L225 Difference]: With dead ends: 1469 [2025-02-07 22:10:22,635 INFO L226 Difference]: Without dead ends: 793 [2025-02-07 22:10:22,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:22,637 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 1062 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1426 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:10:22,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-02-07 22:10:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2025-02-07 22:10:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 784 states have (on average 1.4770408163265305) internal successors, (1158), 784 states have internal predecessors, (1158), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1172 transitions. [2025-02-07 22:10:22,654 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1172 transitions. Word has length 272 [2025-02-07 22:10:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1172 transitions. [2025-02-07 22:10:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1172 transitions. [2025-02-07 22:10:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-07 22:10:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:22,656 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 22:10:22,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 269372324, now seen corresponding path program 1 times [2025-02-07 22:10:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772457922] [2025-02-07 22:10:22,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:22,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-07 22:10:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-07 22:10:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772457922] [2025-02-07 22:10:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772457922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:10:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163119924] [2025-02-07 22:10:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:23,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:10:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:23,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:10:23,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:10:23,550 INFO L87 Difference]: Start difference. First operand 793 states and 1172 transitions. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:24,066 INFO L93 Difference]: Finished difference Result 1477 states and 2181 transitions. [2025-02-07 22:10:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:10:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 273 [2025-02-07 22:10:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:24,069 INFO L225 Difference]: With dead ends: 1477 [2025-02-07 22:10:24,069 INFO L226 Difference]: Without dead ends: 801 [2025-02-07 22:10:24,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:10:24,070 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 1039 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 4623 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:24,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 4623 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:10:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-02-07 22:10:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 798. [2025-02-07 22:10:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 789 states have (on average 1.4752851711026616) internal successors, (1164), 789 states have internal predecessors, (1164), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1178 transitions. [2025-02-07 22:10:24,084 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1178 transitions. Word has length 273 [2025-02-07 22:10:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:24,084 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1178 transitions. [2025-02-07 22:10:24,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-07 22:10:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1178 transitions. [2025-02-07 22:10:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 22:10:24,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:24,086 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 22:10:24,086 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:24,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash 414359622, now seen corresponding path program 1 times [2025-02-07 22:10:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769574876] [2025-02-07 22:10:24,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:24,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 22:10:24,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 22:10:24,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:24,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:24,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769574876] [2025-02-07 22:10:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769574876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:24,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:24,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:10:24,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671230890] [2025-02-07 22:10:24,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:24,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:10:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:24,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:10:24,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:10:24,400 INFO L87 Difference]: Start difference. First operand 798 states and 1178 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:25,117 INFO L93 Difference]: Finished difference Result 1483 states and 2187 transitions. [2025-02-07 22:10:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:10:25,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 274 [2025-02-07 22:10:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:25,123 INFO L225 Difference]: With dead ends: 1483 [2025-02-07 22:10:25,124 INFO L226 Difference]: Without dead ends: 802 [2025-02-07 22:10:25,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:10:25,125 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 1105 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:25,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2817 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:10:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-07 22:10:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2025-02-07 22:10:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 791 states have (on average 1.4740834386852086) internal successors, (1166), 791 states have internal predecessors, (1166), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1180 transitions. [2025-02-07 22:10:25,139 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1180 transitions. Word has length 274 [2025-02-07 22:10:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1180 transitions. [2025-02-07 22:10:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1180 transitions. [2025-02-07 22:10:25,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-07 22:10:25,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:25,142 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:25,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 22:10:25,142 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:25,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -50422916, now seen corresponding path program 1 times [2025-02-07 22:10:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190405268] [2025-02-07 22:10:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:25,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-07 22:10:25,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-07 22:10:25,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:25,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190405268] [2025-02-07 22:10:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190405268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:25,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:25,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688816266] [2025-02-07 22:10:25,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:25,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:25,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:25,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:25,526 INFO L87 Difference]: Start difference. First operand 800 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:26,116 INFO L93 Difference]: Finished difference Result 1485 states and 2188 transitions. [2025-02-07 22:10:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:10:26,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 274 [2025-02-07 22:10:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:26,123 INFO L225 Difference]: With dead ends: 1485 [2025-02-07 22:10:26,123 INFO L226 Difference]: Without dead ends: 802 [2025-02-07 22:10:26,124 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:10:26,124 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 1106 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:26,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 2122 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:10:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-07 22:10:26,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2025-02-07 22:10:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 793 states have (on average 1.4728877679697352) internal successors, (1168), 793 states have internal predecessors, (1168), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1182 transitions. [2025-02-07 22:10:26,135 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1182 transitions. Word has length 274 [2025-02-07 22:10:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:26,136 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1182 transitions. [2025-02-07 22:10:26,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1182 transitions. [2025-02-07 22:10:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-07 22:10:26,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:26,137 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:26,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 22:10:26,137 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:26,138 INFO L85 PathProgramCache]: Analyzing trace with hash -676187772, now seen corresponding path program 1 times [2025-02-07 22:10:26,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:26,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537586416] [2025-02-07 22:10:26,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:26,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:26,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-07 22:10:26,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-07 22:10:26,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:26,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537586416] [2025-02-07 22:10:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537586416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:26,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843297657] [2025-02-07 22:10:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:26,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:26,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:26,644 INFO L87 Difference]: Start difference. First operand 802 states and 1182 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:26,936 INFO L93 Difference]: Finished difference Result 1487 states and 2189 transitions. [2025-02-07 22:10:26,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:26,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 275 [2025-02-07 22:10:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:26,939 INFO L225 Difference]: With dead ends: 1487 [2025-02-07 22:10:26,939 INFO L226 Difference]: Without dead ends: 802 [2025-02-07 22:10:26,940 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:10:26,941 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 977 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:26,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1835 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-07 22:10:26,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2025-02-07 22:10:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 793 states have (on average 1.4716267339218159) internal successors, (1167), 793 states have internal predecessors, (1167), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1181 transitions. [2025-02-07 22:10:26,956 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1181 transitions. Word has length 275 [2025-02-07 22:10:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:26,956 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1181 transitions. [2025-02-07 22:10:26,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1181 transitions. [2025-02-07 22:10:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-07 22:10:26,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:26,959 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:26,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 22:10:26,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:26,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:26,959 INFO L85 PathProgramCache]: Analyzing trace with hash -483184161, now seen corresponding path program 1 times [2025-02-07 22:10:26,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:26,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197686990] [2025-02-07 22:10:26,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:26,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:27,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-07 22:10:27,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-07 22:10:27,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:27,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:27,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197686990] [2025-02-07 22:10:27,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197686990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:27,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:27,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:27,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489348019] [2025-02-07 22:10:27,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:27,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:27,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:27,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:27,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:27,545 INFO L87 Difference]: Start difference. First operand 802 states and 1181 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:27,826 INFO L93 Difference]: Finished difference Result 1487 states and 2187 transitions. [2025-02-07 22:10:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 276 [2025-02-07 22:10:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:27,830 INFO L225 Difference]: With dead ends: 1487 [2025-02-07 22:10:27,830 INFO L226 Difference]: Without dead ends: 802 [2025-02-07 22:10:27,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:10:27,832 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 934 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:27,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1835 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2025-02-07 22:10:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2025-02-07 22:10:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 793 states have (on average 1.4703656998738965) internal successors, (1166), 793 states have internal predecessors, (1166), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 22:10:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1180 transitions. [2025-02-07 22:10:27,845 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1180 transitions. Word has length 276 [2025-02-07 22:10:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:27,846 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1180 transitions. [2025-02-07 22:10:27,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:27,846 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1180 transitions. [2025-02-07 22:10:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-02-07 22:10:27,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:27,848 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:27,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 22:10:27,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:27,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:27,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1354343968, now seen corresponding path program 1 times [2025-02-07 22:10:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966738123] [2025-02-07 22:10:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:27,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-02-07 22:10:28,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-02-07 22:10:28,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:28,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:28,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:28,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966738123] [2025-02-07 22:10:28,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966738123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:28,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 22:10:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689437239] [2025-02-07 22:10:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:10:28,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:28,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:10:28,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:10:28,873 INFO L87 Difference]: Start difference. First operand 802 states and 1180 transitions. Second operand has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:31,279 INFO L93 Difference]: Finished difference Result 2307 states and 3387 transitions. [2025-02-07 22:10:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 22:10:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 277 [2025-02-07 22:10:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:31,283 INFO L225 Difference]: With dead ends: 2307 [2025-02-07 22:10:31,283 INFO L226 Difference]: Without dead ends: 1622 [2025-02-07 22:10:31,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:10:31,285 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 2177 mSDsluCounter, 9548 mSDsCounter, 0 mSdLazyCounter, 5668 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2192 SdHoareTripleChecker+Valid, 11051 SdHoareTripleChecker+Invalid, 5690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:31,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2192 Valid, 11051 Invalid, 5690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5668 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 22:10:31,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-02-07 22:10:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1072. [2025-02-07 22:10:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1052 states have (on average 1.4629277566539924) internal successors, (1539), 1052 states have internal predecessors, (1539), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-07 22:10:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1575 transitions. [2025-02-07 22:10:31,303 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1575 transitions. Word has length 277 [2025-02-07 22:10:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1575 transitions. [2025-02-07 22:10:31,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-07 22:10:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1575 transitions. [2025-02-07 22:10:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-07 22:10:31,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:31,306 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:31,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 22:10:31,306 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:31,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 823901659, now seen corresponding path program 1 times [2025-02-07 22:10:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:31,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209988755] [2025-02-07 22:10:31,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:31,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-07 22:10:31,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-07 22:10:31,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:31,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:32,240 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 22:10:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:32,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209988755] [2025-02-07 22:10:32,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209988755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:32,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:32,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:10:32,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952039847] [2025-02-07 22:10:32,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:32,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:10:32,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:32,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:10:32,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:10:32,242 INFO L87 Difference]: Start difference. First operand 1072 states and 1575 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:32,882 INFO L93 Difference]: Finished difference Result 2107 states and 3090 transitions. [2025-02-07 22:10:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:10:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 278 [2025-02-07 22:10:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:32,888 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:32,888 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:32,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:10:32,890 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 2089 mSDsluCounter, 3725 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 4659 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:10:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4580645161290322) internal successors, (2034), 1395 states have internal predecessors, (2034), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2084 transitions. [2025-02-07 22:10:32,922 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2084 transitions. Word has length 278 [2025-02-07 22:10:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:32,922 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2084 transitions. [2025-02-07 22:10:32,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-07 22:10:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2084 transitions. [2025-02-07 22:10:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2025-02-07 22:10:32,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:32,929 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 22:10:32,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:32,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash -344398150, now seen corresponding path program 1 times [2025-02-07 22:10:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967238807] [2025-02-07 22:10:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:33,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 652 statements into 1 equivalence classes. [2025-02-07 22:10:33,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 652 of 652 statements. [2025-02-07 22:10:33,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:33,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967238807] [2025-02-07 22:10:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967238807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:33,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878601638] [2025-02-07 22:10:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:33,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:33,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:33,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:33,891 INFO L87 Difference]: Start difference. First operand 1422 states and 2084 transitions. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:34,179 INFO L93 Difference]: Finished difference Result 2107 states and 3089 transitions. [2025-02-07 22:10:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 652 [2025-02-07 22:10:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:34,183 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:34,183 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:34,184 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:10:34,184 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 1003 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:34,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1845 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.457347670250896) internal successors, (2033), 1395 states have internal predecessors, (2033), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2083 transitions. [2025-02-07 22:10:34,203 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2083 transitions. Word has length 652 [2025-02-07 22:10:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:34,203 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2083 transitions. [2025-02-07 22:10:34,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:34,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2083 transitions. [2025-02-07 22:10:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2025-02-07 22:10:34,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:34,212 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 22:10:34,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1255932355, now seen corresponding path program 1 times [2025-02-07 22:10:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708250726] [2025-02-07 22:10:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:34,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 653 statements into 1 equivalence classes. [2025-02-07 22:10:34,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 653 of 653 statements. [2025-02-07 22:10:34,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:34,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708250726] [2025-02-07 22:10:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708250726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796357963] [2025-02-07 22:10:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:35,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:35,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:35,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:35,060 INFO L87 Difference]: Start difference. First operand 1422 states and 2083 transitions. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:35,345 INFO L93 Difference]: Finished difference Result 2107 states and 3087 transitions. [2025-02-07 22:10:35,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 653 [2025-02-07 22:10:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:35,349 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:35,349 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:35,350 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:10:35,350 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 1839 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:35,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 1835 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.45663082437276) internal successors, (2032), 1395 states have internal predecessors, (2032), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2082 transitions. [2025-02-07 22:10:35,367 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2082 transitions. Word has length 653 [2025-02-07 22:10:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2082 transitions. [2025-02-07 22:10:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2082 transitions. [2025-02-07 22:10:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2025-02-07 22:10:35,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:35,371 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:35,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 22:10:35,372 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:35,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1211701525, now seen corresponding path program 1 times [2025-02-07 22:10:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:35,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585792280] [2025-02-07 22:10:35,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:35,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 654 statements into 1 equivalence classes. [2025-02-07 22:10:35,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 654 of 654 statements. [2025-02-07 22:10:35,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:35,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585792280] [2025-02-07 22:10:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585792280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206576541] [2025-02-07 22:10:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:36,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:36,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:36,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:36,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:36,221 INFO L87 Difference]: Start difference. First operand 1422 states and 2082 transitions. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:10:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:36,767 INFO L93 Difference]: Finished difference Result 2107 states and 3085 transitions. [2025-02-07 22:10:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:36,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 654 [2025-02-07 22:10:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:36,778 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:36,778 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:36,779 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:10:36,785 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1751 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:36,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1403 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:10:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4559139784946236) internal successors, (2031), 1395 states have internal predecessors, (2031), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2081 transitions. [2025-02-07 22:10:36,810 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2081 transitions. Word has length 654 [2025-02-07 22:10:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:36,810 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2081 transitions. [2025-02-07 22:10:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:10:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2081 transitions. [2025-02-07 22:10:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-02-07 22:10:36,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:36,814 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:36,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 22:10:36,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:36,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash 849646734, now seen corresponding path program 1 times [2025-02-07 22:10:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969973799] [2025-02-07 22:10:36,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:36,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-02-07 22:10:37,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-02-07 22:10:37,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:37,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969973799] [2025-02-07 22:10:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969973799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:37,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:37,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413068343] [2025-02-07 22:10:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:37,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:37,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:37,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:37,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:37,854 INFO L87 Difference]: Start difference. First operand 1422 states and 2081 transitions. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:38,142 INFO L93 Difference]: Finished difference Result 2107 states and 3083 transitions. [2025-02-07 22:10:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 655 [2025-02-07 22:10:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:38,147 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:38,147 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:38,148 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:10:38,148 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 1739 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1746 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:38,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1746 Valid, 1833 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4551971326164874) internal successors, (2030), 1395 states have internal predecessors, (2030), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2080 transitions. [2025-02-07 22:10:38,166 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2080 transitions. Word has length 655 [2025-02-07 22:10:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:38,167 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2080 transitions. [2025-02-07 22:10:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2080 transitions. [2025-02-07 22:10:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-02-07 22:10:38,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:38,173 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:38,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 22:10:38,173 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:38,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash 543735015, now seen corresponding path program 1 times [2025-02-07 22:10:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:38,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114289370] [2025-02-07 22:10:38,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:38,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-02-07 22:10:38,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-02-07 22:10:38,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:38,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114289370] [2025-02-07 22:10:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114289370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:39,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806751548] [2025-02-07 22:10:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:39,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:39,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:39,044 INFO L87 Difference]: Start difference. First operand 1422 states and 2080 transitions. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:39,335 INFO L93 Difference]: Finished difference Result 2107 states and 3081 transitions. [2025-02-07 22:10:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 656 [2025-02-07 22:10:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:39,339 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:39,339 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:39,340 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:10:39,341 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 937 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:39,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1843 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4544802867383513) internal successors, (2029), 1395 states have internal predecessors, (2029), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2079 transitions. [2025-02-07 22:10:39,357 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2079 transitions. Word has length 656 [2025-02-07 22:10:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2079 transitions. [2025-02-07 22:10:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2079 transitions. [2025-02-07 22:10:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-02-07 22:10:39,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:39,362 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:39,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 22:10:39,362 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1198946817, now seen corresponding path program 1 times [2025-02-07 22:10:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39697739] [2025-02-07 22:10:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:39,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-02-07 22:10:39,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-02-07 22:10:39,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:39,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39697739] [2025-02-07 22:10:40,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39697739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:40,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:40,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:10:40,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123556902] [2025-02-07 22:10:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:10:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:40,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:10:40,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:10:40,222 INFO L87 Difference]: Start difference. First operand 1422 states and 2079 transitions. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:10:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:40,724 INFO L93 Difference]: Finished difference Result 2107 states and 3079 transitions. [2025-02-07 22:10:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 657 [2025-02-07 22:10:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:40,728 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:40,728 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:40,729 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:10:40,729 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 857 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:40,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1409 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:10:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:40,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4537634408602151) internal successors, (2028), 1395 states have internal predecessors, (2028), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2078 transitions. [2025-02-07 22:10:40,747 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2078 transitions. Word has length 657 [2025-02-07 22:10:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:40,748 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2078 transitions. [2025-02-07 22:10:40,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:10:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2078 transitions. [2025-02-07 22:10:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-02-07 22:10:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:40,752 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 22:10:40,752 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:40,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1478301432, now seen corresponding path program 1 times [2025-02-07 22:10:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128464876] [2025-02-07 22:10:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:40,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-02-07 22:10:41,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-02-07 22:10:41,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:41,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:42,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128464876] [2025-02-07 22:10:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128464876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82585575] [2025-02-07 22:10:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:42,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:42,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:42,736 INFO L87 Difference]: Start difference. First operand 1422 states and 2078 transitions. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:43,027 INFO L93 Difference]: Finished difference Result 2107 states and 3077 transitions. [2025-02-07 22:10:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 658 [2025-02-07 22:10:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:43,031 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:43,032 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:43,033 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:10:43,033 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 840 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:43,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1831 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 22:10:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4530465949820788) internal successors, (2027), 1395 states have internal predecessors, (2027), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2077 transitions. [2025-02-07 22:10:43,061 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2077 transitions. Word has length 658 [2025-02-07 22:10:43,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:43,061 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2077 transitions. [2025-02-07 22:10:43,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2077 transitions. [2025-02-07 22:10:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-02-07 22:10:43,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:43,068 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:43,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 22:10:43,069 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:43,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1534705443, now seen corresponding path program 1 times [2025-02-07 22:10:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064101217] [2025-02-07 22:10:43,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:43,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:43,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-02-07 22:10:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-02-07 22:10:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:45,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:45,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064101217] [2025-02-07 22:10:45,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064101217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:45,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:45,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:10:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603410200] [2025-02-07 22:10:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:45,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:10:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:45,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:10:45,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:10:45,154 INFO L87 Difference]: Start difference. First operand 1422 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:45,417 INFO L93 Difference]: Finished difference Result 2107 states and 3075 transitions. [2025-02-07 22:10:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:10:45,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 659 [2025-02-07 22:10:45,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:45,420 INFO L225 Difference]: With dead ends: 2107 [2025-02-07 22:10:45,420 INFO L226 Difference]: Without dead ends: 1422 [2025-02-07 22:10:45,421 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:10:45,421 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 783 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:45,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 1831 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 22:10:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2025-02-07 22:10:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1422. [2025-02-07 22:10:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1395 states have (on average 1.4523297491039426) internal successors, (2026), 1395 states have internal predecessors, (2026), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-07 22:10:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2076 transitions. [2025-02-07 22:10:45,437 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2076 transitions. Word has length 659 [2025-02-07 22:10:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:45,438 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2076 transitions. [2025-02-07 22:10:45,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:10:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2076 transitions. [2025-02-07 22:10:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-02-07 22:10:45,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:45,442 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 22:10:45,442 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:45,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1100892806, now seen corresponding path program 1 times [2025-02-07 22:10:45,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:45,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883601852] [2025-02-07 22:10:45,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:45,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-02-07 22:10:47,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-02-07 22:10:47,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:47,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-02-07 22:10:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883601852] [2025-02-07 22:10:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883601852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:49,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 22:10:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007473052] [2025-02-07 22:10:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:49,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 22:10:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:49,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 22:10:49,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-07 22:10:49,258 INFO L87 Difference]: Start difference. First operand 1422 states and 2076 transitions. Second operand has 10 states, 10 states have (on average 48.2) internal successors, (482), 10 states have internal predecessors, (482), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-07 22:10:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:51,062 INFO L93 Difference]: Finished difference Result 3191 states and 4651 transitions. [2025-02-07 22:10:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 22:10:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.2) internal successors, (482), 10 states have internal predecessors, (482), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 660 [2025-02-07 22:10:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:51,070 INFO L225 Difference]: With dead ends: 3191 [2025-02-07 22:10:51,070 INFO L226 Difference]: Without dead ends: 2294 [2025-02-07 22:10:51,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-07 22:10:51,072 INFO L435 NwaCegarLoop]: 1174 mSDtfsCounter, 1898 mSDsluCounter, 7626 mSDsCounter, 0 mSdLazyCounter, 5702 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 8800 SdHoareTripleChecker+Invalid, 5705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:51,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 8800 Invalid, 5705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5702 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 22:10:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2025-02-07 22:10:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 1398. [2025-02-07 22:10:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1370 states have (on average 1.4525547445255473) internal successors, (1990), 1370 states have internal predecessors, (1990), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-07 22:10:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2042 transitions. [2025-02-07 22:10:51,097 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2042 transitions. Word has length 660 [2025-02-07 22:10:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:51,097 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2042 transitions. [2025-02-07 22:10:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.2) internal successors, (482), 10 states have internal predecessors, (482), 4 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-07 22:10:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2042 transitions. [2025-02-07 22:10:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-02-07 22:10:51,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:51,101 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:51,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 22:10:51,101 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -138691004, now seen corresponding path program 1 times [2025-02-07 22:10:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36689901] [2025-02-07 22:10:51,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-02-07 22:10:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-02-07 22:10:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:10:52,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36689901] [2025-02-07 22:10:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36689901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:10:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664909149] [2025-02-07 22:10:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:10:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:52,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:10:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:10:52,465 INFO L87 Difference]: Start difference. First operand 1398 states and 2042 transitions. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-07 22:10:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:53,534 INFO L93 Difference]: Finished difference Result 2993 states and 4366 transitions. [2025-02-07 22:10:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:10:53,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 660 [2025-02-07 22:10:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:53,542 INFO L225 Difference]: With dead ends: 2993 [2025-02-07 22:10:53,542 INFO L226 Difference]: Without dead ends: 2263 [2025-02-07 22:10:53,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:10:53,544 INFO L435 NwaCegarLoop]: 1199 mSDtfsCounter, 1759 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:53,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 4248 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 22:10:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2025-02-07 22:10:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 1994. [2025-02-07 22:10:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1955 states have (on average 1.4506393861892584) internal successors, (2836), 1955 states have internal predecessors, (2836), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 22:10:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2910 transitions. [2025-02-07 22:10:53,568 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2910 transitions. Word has length 660 [2025-02-07 22:10:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:53,569 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2910 transitions. [2025-02-07 22:10:53,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-07 22:10:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2910 transitions. [2025-02-07 22:10:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-02-07 22:10:53,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:53,573 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 22:10:53,573 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:53,574 INFO L85 PathProgramCache]: Analyzing trace with hash 983134609, now seen corresponding path program 1 times [2025-02-07 22:10:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709344074] [2025-02-07 22:10:53,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:53,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-02-07 22:10:55,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-02-07 22:10:55,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:55,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:10:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-02-07 22:10:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:10:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709344074] [2025-02-07 22:10:56,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709344074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:10:56,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:10:56,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 22:10:56,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441018135] [2025-02-07 22:10:56,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:10:56,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 22:10:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:10:56,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 22:10:56,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:10:56,063 INFO L87 Difference]: Start difference. First operand 1994 states and 2910 transitions. Second operand has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-07 22:10:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:10:56,631 INFO L93 Difference]: Finished difference Result 3395 states and 4950 transitions. [2025-02-07 22:10:56,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:10:56,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 660 [2025-02-07 22:10:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:10:56,635 INFO L225 Difference]: With dead ends: 3395 [2025-02-07 22:10:56,635 INFO L226 Difference]: Without dead ends: 2269 [2025-02-07 22:10:56,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:10:56,637 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1470 mSDsluCounter, 4734 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 6314 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 22:10:56,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 6314 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 22:10:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2025-02-07 22:10:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2000. [2025-02-07 22:10:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1961 states have (on average 1.449260581336053) internal successors, (2842), 1961 states have internal predecessors, (2842), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 22:10:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2916 transitions. [2025-02-07 22:10:56,659 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2916 transitions. Word has length 660 [2025-02-07 22:10:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:10:56,659 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2916 transitions. [2025-02-07 22:10:56,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-07 22:10:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2916 transitions. [2025-02-07 22:10:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-02-07 22:10:56,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:10:56,663 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:10:56,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 22:10:56,664 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:10:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:10:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2109306753, now seen corresponding path program 1 times [2025-02-07 22:10:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:10:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101581492] [2025-02-07 22:10:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:10:56,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:10:56,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-02-07 22:10:59,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-02-07 22:10:59,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:10:59,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-02-07 22:11:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101581492] [2025-02-07 22:11:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101581492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:01,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 22:11:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397179498] [2025-02-07 22:11:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:01,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 22:11:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:01,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 22:11:01,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-07 22:11:01,100 INFO L87 Difference]: Start difference. First operand 2000 states and 2916 transitions. Second operand has 11 states, 11 states have (on average 43.18181818181818) internal successors, (475), 11 states have internal predecessors, (475), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 22:11:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:02,436 INFO L93 Difference]: Finished difference Result 4928 states and 7175 transitions. [2025-02-07 22:11:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 22:11:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 43.18181818181818) internal successors, (475), 11 states have internal predecessors, (475), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 661 [2025-02-07 22:11:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:02,442 INFO L225 Difference]: With dead ends: 4928 [2025-02-07 22:11:02,442 INFO L226 Difference]: Without dead ends: 3444 [2025-02-07 22:11:02,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-07 22:11:02,445 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 2843 mSDsluCounter, 5700 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2859 SdHoareTripleChecker+Valid, 6531 SdHoareTripleChecker+Invalid, 3445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:02,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2859 Valid, 6531 Invalid, 3445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3424 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 22:11:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2025-02-07 22:11:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 2562. [2025-02-07 22:11:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2500 states have (on average 1.4484) internal successors, (3621), 2500 states have internal predecessors, (3621), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 22:11:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3741 transitions. [2025-02-07 22:11:02,484 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3741 transitions. Word has length 661 [2025-02-07 22:11:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:02,484 INFO L471 AbstractCegarLoop]: Abstraction has 2562 states and 3741 transitions. [2025-02-07 22:11:02,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 43.18181818181818) internal successors, (475), 11 states have internal predecessors, (475), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-07 22:11:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3741 transitions. [2025-02-07 22:11:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-02-07 22:11:02,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:02,490 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:02,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 22:11:02,491 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:02,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1303197089, now seen corresponding path program 1 times [2025-02-07 22:11:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574290864] [2025-02-07 22:11:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:02,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-02-07 22:11:05,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-02-07 22:11:05,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:05,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:06,361 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-02-07 22:11:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574290864] [2025-02-07 22:11:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574290864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:06,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:11:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212304776] [2025-02-07 22:11:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:06,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:11:06,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:06,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:11:06,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:11:06,363 INFO L87 Difference]: Start difference. First operand 2562 states and 3741 transitions. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:11:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:06,979 INFO L93 Difference]: Finished difference Result 3780 states and 5510 transitions. [2025-02-07 22:11:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 22:11:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 662 [2025-02-07 22:11:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:06,983 INFO L225 Difference]: With dead ends: 3780 [2025-02-07 22:11:06,983 INFO L226 Difference]: Without dead ends: 2578 [2025-02-07 22:11:06,985 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:11:06,985 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 1010 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:06,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 2109 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 22:11:06,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-02-07 22:11:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2570. [2025-02-07 22:11:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2508 states have (on average 1.446969696969697) internal successors, (3629), 2508 states have internal predecessors, (3629), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 22:11:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3749 transitions. [2025-02-07 22:11:07,016 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3749 transitions. Word has length 662 [2025-02-07 22:11:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:07,016 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 3749 transitions. [2025-02-07 22:11:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:11:07,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3749 transitions. [2025-02-07 22:11:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-02-07 22:11:07,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:07,021 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:07,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 22:11:07,022 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 281434295, now seen corresponding path program 1 times [2025-02-07 22:11:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:07,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437523021] [2025-02-07 22:11:07,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:07,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-02-07 22:11:08,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-02-07 22:11:08,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:08,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-02-07 22:11:09,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:09,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437523021] [2025-02-07 22:11:09,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437523021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:09,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:11:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77604064] [2025-02-07 22:11:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:09,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:11:09,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:09,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:11:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:09,915 INFO L87 Difference]: Start difference. First operand 2570 states and 3749 transitions. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 22:11:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:10,674 INFO L93 Difference]: Finished difference Result 4648 states and 6775 transitions. [2025-02-07 22:11:10,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:11:10,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 664 [2025-02-07 22:11:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:10,679 INFO L225 Difference]: With dead ends: 4648 [2025-02-07 22:11:10,679 INFO L226 Difference]: Without dead ends: 2580 [2025-02-07 22:11:10,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:11:10,681 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 1048 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:10,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2756 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 22:11:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-02-07 22:11:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2575. [2025-02-07 22:11:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2513 states have (on average 1.4460803820135297) internal successors, (3634), 2513 states have internal predecessors, (3634), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-07 22:11:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3754 transitions. [2025-02-07 22:11:10,709 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3754 transitions. Word has length 664 [2025-02-07 22:11:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:10,710 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 3754 transitions. [2025-02-07 22:11:10,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-07 22:11:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3754 transitions. [2025-02-07 22:11:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-02-07 22:11:10,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:10,715 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:10,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 22:11:10,715 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:10,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1689822009, now seen corresponding path program 1 times [2025-02-07 22:11:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:10,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936808990] [2025-02-07 22:11:10,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:10,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-02-07 22:11:13,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-02-07 22:11:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:11:13,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:13,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936808990] [2025-02-07 22:11:13,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936808990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:13,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:13,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:11:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96261346] [2025-02-07 22:11:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:13,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:11:13,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:13,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:11:13,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:13,734 INFO L87 Difference]: Start difference. First operand 2575 states and 3754 transitions. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:11:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:14,569 INFO L93 Difference]: Finished difference Result 5810 states and 8462 transitions. [2025-02-07 22:11:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:11:14,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 666 [2025-02-07 22:11:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:14,578 INFO L225 Difference]: With dead ends: 5810 [2025-02-07 22:11:14,578 INFO L226 Difference]: Without dead ends: 4775 [2025-02-07 22:11:14,581 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:11:14,581 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 1248 mSDsluCounter, 3673 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 5068 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:14,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 5068 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:11:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2025-02-07 22:11:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4291. [2025-02-07 22:11:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4291 states, 4183 states have (on average 1.444896007650012) internal successors, (6044), 4183 states have internal predecessors, (6044), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-02-07 22:11:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 6256 transitions. [2025-02-07 22:11:14,642 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 6256 transitions. Word has length 666 [2025-02-07 22:11:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:14,643 INFO L471 AbstractCegarLoop]: Abstraction has 4291 states and 6256 transitions. [2025-02-07 22:11:14,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-07 22:11:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 6256 transitions. [2025-02-07 22:11:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-02-07 22:11:14,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:14,650 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 22:11:14,650 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1989251347, now seen corresponding path program 1 times [2025-02-07 22:11:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646943255] [2025-02-07 22:11:14,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:14,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-07 22:11:16,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-07 22:11:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-02-07 22:11:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646943255] [2025-02-07 22:11:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646943255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:17,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 22:11:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212222446] [2025-02-07 22:11:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 22:11:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:17,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 22:11:17,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:11:17,973 INFO L87 Difference]: Start difference. First operand 4291 states and 6256 transitions. Second operand has 8 states, 8 states have (on average 61.375) internal successors, (491), 8 states have internal predecessors, (491), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:11:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:19,410 INFO L93 Difference]: Finished difference Result 9193 states and 13391 transitions. [2025-02-07 22:11:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 22:11:19,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 61.375) internal successors, (491), 8 states have internal predecessors, (491), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 667 [2025-02-07 22:11:19,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:19,425 INFO L225 Difference]: With dead ends: 9193 [2025-02-07 22:11:19,425 INFO L226 Difference]: Without dead ends: 7765 [2025-02-07 22:11:19,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 22:11:19,429 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 3508 mSDsluCounter, 4092 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3522 SdHoareTripleChecker+Valid, 5263 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:19,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3522 Valid, 5263 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 22:11:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7765 states. [2025-02-07 22:11:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7765 to 5356. [2025-02-07 22:11:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5356 states, 5202 states have (on average 1.4444444444444444) internal successors, (7514), 5202 states have internal predecessors, (7514), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-07 22:11:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5356 states to 5356 states and 7818 transitions. [2025-02-07 22:11:19,500 INFO L78 Accepts]: Start accepts. Automaton has 5356 states and 7818 transitions. Word has length 667 [2025-02-07 22:11:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:19,500 INFO L471 AbstractCegarLoop]: Abstraction has 5356 states and 7818 transitions. [2025-02-07 22:11:19,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.375) internal successors, (491), 8 states have internal predecessors, (491), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:11:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 5356 states and 7818 transitions. [2025-02-07 22:11:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-02-07 22:11:19,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:19,509 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 22:11:19,509 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash -675963207, now seen corresponding path program 1 times [2025-02-07 22:11:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:19,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835084346] [2025-02-07 22:11:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:19,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:19,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-02-07 22:11:22,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-02-07 22:11:22,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:11:22,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:11:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-07 22:11:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:11:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835084346] [2025-02-07 22:11:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835084346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:11:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:11:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 22:11:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520843587] [2025-02-07 22:11:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:11:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:11:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:11:23,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:11:23,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:11:23,112 INFO L87 Difference]: Start difference. First operand 5356 states and 7818 transitions. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:11:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:11:23,953 INFO L93 Difference]: Finished difference Result 6418 states and 9360 transitions. [2025-02-07 22:11:23,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:11:23,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 667 [2025-02-07 22:11:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:11:23,959 INFO L225 Difference]: With dead ends: 6418 [2025-02-07 22:11:23,959 INFO L226 Difference]: Without dead ends: 5383 [2025-02-07 22:11:23,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:11:23,961 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2123 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 2922 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:11:23,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 2922 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 22:11:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5383 states. [2025-02-07 22:11:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5383 to 5357. [2025-02-07 22:11:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5357 states, 5203 states have (on average 1.4443590236402075) internal successors, (7515), 5203 states have internal predecessors, (7515), 152 states have call successors, (152), 1 states have call predecessors, (152), 1 states have return successors, (152), 152 states have call predecessors, (152), 152 states have call successors, (152) [2025-02-07 22:11:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 7819 transitions. [2025-02-07 22:11:24,023 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 7819 transitions. Word has length 667 [2025-02-07 22:11:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:11:24,023 INFO L471 AbstractCegarLoop]: Abstraction has 5357 states and 7819 transitions. [2025-02-07 22:11:24,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-07 22:11:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 7819 transitions. [2025-02-07 22:11:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-02-07 22:11:24,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:11:24,031 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 22:11:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 22:11:24,032 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:11:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:11:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash 329190731, now seen corresponding path program 1 times [2025-02-07 22:11:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:11:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871239276] [2025-02-07 22:11:24,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:11:24,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:11:24,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes.