./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label17.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:02:31,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:02:31,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:02:31,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:02:31,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:02:31,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:02:31,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:02:31,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:02:31,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:02:31,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:02:31,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:02:31,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:02:31,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:02:31,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:02:31,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:02:31,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:02:31,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:02:31,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f [2025-02-05 12:02:31,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:02:31,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:02:31,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:02:31,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:02:31,494 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:02:31,495 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-02-05 12:02:32,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18b9e706e/f689e886f96d46428f2687d8860cced3/FLAG7f8f5d3b5 [2025-02-05 12:02:33,100 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:02:33,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-02-05 12:02:33,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18b9e706e/f689e886f96d46428f2687d8860cced3/FLAG7f8f5d3b5 [2025-02-05 12:02:33,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/18b9e706e/f689e886f96d46428f2687d8860cced3 [2025-02-05 12:02:33,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:02:33,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:02:33,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:02:33,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:02:33,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:02:33,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:33,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33, skipping insertion in model container [2025-02-05 12:02:33,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:33,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:02:33,344 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/eca-rers2012/Problem17_label17.c[5781,5794] [2025-02-05 12:02:33,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:02:33,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:02:33,674 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/eca-rers2012/Problem17_label17.c[5781,5794] [2025-02-05 12:02:33,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:02:33,894 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:02:33,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33 WrapperNode [2025-02-05 12:02:33,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:02:33,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:02:33,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:02:33,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:02:33,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:33,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,095 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:02:34,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:02:34,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:02:34,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:02:34,097 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:02:34,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,298 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:02:34,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:02:34,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:02:34,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:02:34,483 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:02:34,485 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (1/1) ... [2025-02-05 12:02:34,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:02:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:34,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:02:34,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:02:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:02:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:02:34,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:02:34,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:02:34,592 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:02:34,593 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:02:37,289 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:02:37,384 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:02:37,384 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:02:37,466 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:02:37,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:02:37,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:02:37 BoogieIcfgContainer [2025-02-05 12:02:37,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:02:37,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:02:37,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:02:37,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:02:37,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:02:33" (1/3) ... [2025-02-05 12:02:37,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac2e8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:02:37, skipping insertion in model container [2025-02-05 12:02:37,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:02:33" (2/3) ... [2025-02-05 12:02:37,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac2e8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:02:37, skipping insertion in model container [2025-02-05 12:02:37,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:02:37" (3/3) ... [2025-02-05 12:02:37,479 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label17.c [2025-02-05 12:02:37,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:02:37,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label17.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:02:37,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:02:37,569 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;@7f268e3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:02:37,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:02:37,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 12:02:37,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:37,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:37,581 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash -53292530, now seen corresponding path program 1 times [2025-02-05 12:02:37,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616266859] [2025-02-05 12:02:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:37,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 12:02:37,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 12:02:37,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:37,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:37,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:37,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616266859] [2025-02-05 12:02:37,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616266859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:37,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759303792] [2025-02-05 12:02:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:37,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:37,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:37,915 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:39,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:39,933 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-02-05 12:02:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 12:02:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:39,946 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 12:02:39,946 INFO L226 Difference]: Without dead ends: 977 [2025-02-05 12:02:39,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:39,951 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 450 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:39,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:02:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-02-05 12:02:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-02-05 12:02:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-02-05 12:02:40,014 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 38 [2025-02-05 12:02:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:40,016 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-02-05 12:02:40,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-02-05 12:02:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 12:02:40,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:40,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:02:40,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1425897744, now seen corresponding path program 1 times [2025-02-05 12:02:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032285798] [2025-02-05 12:02:40,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:40,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:40,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 12:02:40,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 12:02:40,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:40,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:40,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032285798] [2025-02-05 12:02:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032285798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45999973] [2025-02-05 12:02:40,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:40,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:40,224 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:42,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:42,073 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-02-05 12:02:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 12:02:42,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:42,079 INFO L225 Difference]: With dead ends: 2813 [2025-02-05 12:02:42,079 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:02:42,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:42,081 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:42,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:02:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:02:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-02-05 12:02:42,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-02-05 12:02:42,125 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 105 [2025-02-05 12:02:42,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:42,126 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-02-05 12:02:42,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-02-05 12:02:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 12:02:42,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:42,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:42,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:02:42,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:42,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1849911850, now seen corresponding path program 1 times [2025-02-05 12:02:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651299727] [2025-02-05 12:02:42,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:42,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 12:02:42,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 12:02:42,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:42,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651299727] [2025-02-05 12:02:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651299727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694663656] [2025-02-05 12:02:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:42,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:42,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:02:42,411 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:45,557 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2025-02-05 12:02:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 12:02:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:45,585 INFO L225 Difference]: With dead ends: 6765 [2025-02-05 12:02:45,588 INFO L226 Difference]: Without dead ends: 4926 [2025-02-05 12:02:45,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-05 12:02:45,596 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 874 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:45,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 12:02:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-02-05 12:02:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2025-02-05 12:02:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2025-02-05 12:02:45,675 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 108 [2025-02-05 12:02:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:45,676 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2025-02-05 12:02:45,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2025-02-05 12:02:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-05 12:02:45,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:45,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:02:45,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:02:45,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1296877534, now seen corresponding path program 1 times [2025-02-05 12:02:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817967381] [2025-02-05 12:02:45,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:45,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-05 12:02:45,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-05 12:02:45,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:45,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 12:02:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817967381] [2025-02-05 12:02:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817967381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:02:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202063648] [2025-02-05 12:02:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:45,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:45,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:45,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:45,895 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:47,508 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2025-02-05 12:02:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2025-02-05 12:02:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:47,555 INFO L225 Difference]: With dead ends: 14436 [2025-02-05 12:02:47,555 INFO L226 Difference]: Without dead ends: 8277 [2025-02-05 12:02:47,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:47,564 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:47,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-02-05 12:02:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2025-02-05 12:02:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2025-02-05 12:02:47,642 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 179 [2025-02-05 12:02:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:47,643 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2025-02-05 12:02:47,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2025-02-05 12:02:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 12:02:47,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:47,646 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:02:47,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:02:47,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:47,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:47,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1666481422, now seen corresponding path program 1 times [2025-02-05 12:02:47,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:47,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390900053] [2025-02-05 12:02:47,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:47,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:47,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 12:02:47,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 12:02:47,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:47,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:02:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:47,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390900053] [2025-02-05 12:02:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390900053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:47,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:47,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:47,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712818891] [2025-02-05 12:02:47,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:47,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:47,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:47,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:47,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:47,862 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:49,294 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2025-02-05 12:02:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:49,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-02-05 12:02:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:49,324 INFO L225 Difference]: With dead ends: 15692 [2025-02-05 12:02:49,324 INFO L226 Difference]: Without dead ends: 9547 [2025-02-05 12:02:49,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:49,341 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 422 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:49,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:02:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2025-02-05 12:02:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2025-02-05 12:02:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2025-02-05 12:02:49,503 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 192 [2025-02-05 12:02:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:49,503 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2025-02-05 12:02:49,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2025-02-05 12:02:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 12:02:49,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:49,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:02:49,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:02:49,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:49,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1120072316, now seen corresponding path program 1 times [2025-02-05 12:02:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:49,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850046295] [2025-02-05 12:02:49,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:49,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 12:02:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 12:02:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:49,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:02:49,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:49,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850046295] [2025-02-05 12:02:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850046295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:49,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:49,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941339037] [2025-02-05 12:02:49,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:49,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:49,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:49,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:49,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:49,654 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:51,206 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2025-02-05 12:02:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-05 12:02:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:51,227 INFO L225 Difference]: With dead ends: 16078 [2025-02-05 12:02:51,227 INFO L226 Difference]: Without dead ends: 9956 [2025-02-05 12:02:51,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:51,234 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:51,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2025-02-05 12:02:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2025-02-05 12:02:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2025-02-05 12:02:51,346 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 199 [2025-02-05 12:02:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:51,346 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2025-02-05 12:02:51,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2025-02-05 12:02:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 12:02:51,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:51,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:51,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:02:51,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:51,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -63307562, now seen corresponding path program 1 times [2025-02-05 12:02:51,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:51,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722014675] [2025-02-05 12:02:51,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 12:02:51,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 12:02:51,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:51,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 12:02:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722014675] [2025-02-05 12:02:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722014675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:51,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819151080] [2025-02-05 12:02:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:51,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:51,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:02:51,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:02:51,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:02:51,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 12:02:51,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 12:02:51,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:51,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:02:51,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:02:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 12:02:52,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:02:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 12:02:52,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819151080] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:02:52,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:02:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:02:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119294399] [2025-02-05 12:02:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:52,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:02:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:52,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:02:52,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:02:52,334 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:54,963 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2025-02-05 12:02:54,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:02:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-02-05 12:02:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:54,992 INFO L225 Difference]: With dead ends: 30575 [2025-02-05 12:02:54,993 INFO L226 Difference]: Without dead ends: 19763 [2025-02-05 12:02:55,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:02:55,001 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:55,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 161 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:02:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2025-02-05 12:02:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2025-02-05 12:02:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2025-02-05 12:02:55,172 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 262 [2025-02-05 12:02:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:55,173 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2025-02-05 12:02:55,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:55,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2025-02-05 12:02:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 12:02:55,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:55,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:02:55,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 12:02:55,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:02:55,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:55,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash 665540048, now seen corresponding path program 1 times [2025-02-05 12:02:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167602688] [2025-02-05 12:02:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:55,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 12:02:55,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 12:02:55,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:02:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:55,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167602688] [2025-02-05 12:02:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167602688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:55,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:55,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:55,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716215262] [2025-02-05 12:02:55,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:55,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:55,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:55,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:55,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:55,581 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:57,156 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2025-02-05 12:02:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:57,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-02-05 12:02:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:57,188 INFO L225 Difference]: With dead ends: 42909 [2025-02-05 12:02:57,188 INFO L226 Difference]: Without dead ends: 22725 [2025-02-05 12:02:57,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:57,202 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 372 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:57,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 898 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22725 states. [2025-02-05 12:02:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22725 to 22725. [2025-02-05 12:02:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1364636507657102) internal successors, (25825), 22724 states have internal predecessors, (25825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 25825 transitions. [2025-02-05 12:02:57,401 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 25825 transitions. Word has length 275 [2025-02-05 12:02:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:57,401 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 25825 transitions. [2025-02-05 12:02:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 25825 transitions. [2025-02-05 12:02:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-02-05 12:02:57,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:57,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:02:57,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:02:57,405 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1387429492, now seen corresponding path program 1 times [2025-02-05 12:02:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622159084] [2025-02-05 12:02:57,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:57,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:57,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-05 12:02:57,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-05 12:02:57,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:57,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:02:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:02:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:02:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622159084] [2025-02-05 12:02:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622159084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:02:57,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:02:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:02:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999612167] [2025-02-05 12:02:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:02:57,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:02:57,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:02:57,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:02:57,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:57,787 INFO L87 Difference]: Start difference. First operand 22725 states and 25825 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:59,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:02:59,446 INFO L93 Difference]: Finished difference Result 56079 states and 63635 transitions. [2025-02-05 12:02:59,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:02:59,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 310 [2025-02-05 12:02:59,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:02:59,484 INFO L225 Difference]: With dead ends: 56079 [2025-02-05 12:02:59,484 INFO L226 Difference]: Without dead ends: 32923 [2025-02-05 12:02:59,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:02:59,504 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 431 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:02:59,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 418 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:02:59,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32923 states. [2025-02-05 12:02:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32923 to 30368. [2025-02-05 12:02:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30368 states, 30367 states have (on average 1.1221062337405736) internal successors, (34075), 30367 states have internal predecessors, (34075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30368 states to 30368 states and 34075 transitions. [2025-02-05 12:02:59,808 INFO L78 Accepts]: Start accepts. Automaton has 30368 states and 34075 transitions. Word has length 310 [2025-02-05 12:02:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:02:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 30368 states and 34075 transitions. [2025-02-05 12:02:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:02:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30368 states and 34075 transitions. [2025-02-05 12:02:59,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-02-05 12:02:59,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:02:59,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:02:59,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:02:59,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:02:59,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:02:59,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1409213982, now seen corresponding path program 1 times [2025-02-05 12:02:59,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:02:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921991567] [2025-02-05 12:02:59,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:02:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:02:59,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-02-05 12:02:59,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-02-05 12:02:59,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:02:59,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 12:03:00,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:00,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921991567] [2025-02-05 12:03:00,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921991567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:00,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:00,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124324796] [2025-02-05 12:03:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:00,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:00,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:00,222 INFO L87 Difference]: Start difference. First operand 30368 states and 34075 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:01,807 INFO L93 Difference]: Finished difference Result 70520 states and 79490 transitions. [2025-02-05 12:03:01,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:01,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2025-02-05 12:03:01,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:01,853 INFO L225 Difference]: With dead ends: 70520 [2025-02-05 12:03:01,854 INFO L226 Difference]: Without dead ends: 38877 [2025-02-05 12:03:01,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:01,876 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 342 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:01,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 776 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:03:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38877 states. [2025-02-05 12:03:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38877 to 37600. [2025-02-05 12:03:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37600 states, 37599 states have (on average 1.1063592116811618) internal successors, (41598), 37599 states have internal predecessors, (41598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37600 states to 37600 states and 41598 transitions. [2025-02-05 12:03:02,239 INFO L78 Accepts]: Start accepts. Automaton has 37600 states and 41598 transitions. Word has length 328 [2025-02-05 12:03:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 37600 states and 41598 transitions. [2025-02-05 12:03:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 37600 states and 41598 transitions. [2025-02-05 12:03:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-02-05 12:03:02,244 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:02,245 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:03:02,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:03:02,245 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:02,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:02,246 INFO L85 PathProgramCache]: Analyzing trace with hash 328145112, now seen corresponding path program 1 times [2025-02-05 12:03:02,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:02,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260507525] [2025-02-05 12:03:02,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:02,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:02,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 12:03:02,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 12:03:02,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:02,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-05 12:03:02,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260507525] [2025-02-05 12:03:02,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260507525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:02,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224840367] [2025-02-05 12:03:02,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:02,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:02,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:03:02,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:03:02,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:03:02,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-02-05 12:03:02,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-02-05 12:03:02,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:02,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:02,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:03:02,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:03:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-05 12:03:03,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:03:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-05 12:03:03,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224840367] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:03:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:03:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:03:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909669869] [2025-02-05 12:03:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:03,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:03,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:03,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:03:03,489 INFO L87 Difference]: Start difference. First operand 37600 states and 41598 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:05,774 INFO L93 Difference]: Finished difference Result 90535 states and 100269 transitions. [2025-02-05 12:03:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 336 [2025-02-05 12:03:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:05,858 INFO L225 Difference]: With dead ends: 90535 [2025-02-05 12:03:05,858 INFO L226 Difference]: Without dead ends: 52510 [2025-02-05 12:03:05,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:03:05,881 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 841 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2325 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:05,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 187 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2325 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:03:05,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52510 states. [2025-02-05 12:03:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52510 to 49957. [2025-02-05 12:03:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49957 states, 49956 states have (on average 1.1099167267195131) internal successors, (55447), 49956 states have internal predecessors, (55447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49957 states to 49957 states and 55447 transitions. [2025-02-05 12:03:06,375 INFO L78 Accepts]: Start accepts. Automaton has 49957 states and 55447 transitions. Word has length 336 [2025-02-05 12:03:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:06,375 INFO L471 AbstractCegarLoop]: Abstraction has 49957 states and 55447 transitions. [2025-02-05 12:03:06,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 49957 states and 55447 transitions. [2025-02-05 12:03:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-02-05 12:03:06,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:06,382 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-05 12:03:06,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 12:03:06,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:03:06,587 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash -13592545, now seen corresponding path program 1 times [2025-02-05 12:03:06,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:06,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054276721] [2025-02-05 12:03:06,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:06,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:06,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-02-05 12:03:06,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-02-05 12:03:06,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:06,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:07,163 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-02-05 12:03:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054276721] [2025-02-05 12:03:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054276721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:07,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:07,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:07,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311171752] [2025-02-05 12:03:07,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:07,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:07,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:07,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:07,165 INFO L87 Difference]: Start difference. First operand 49957 states and 55447 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:08,944 INFO L93 Difference]: Finished difference Result 120386 states and 133258 transitions. [2025-02-05 12:03:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:08,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2025-02-05 12:03:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:09,019 INFO L225 Difference]: With dead ends: 120386 [2025-02-05 12:03:09,019 INFO L226 Difference]: Without dead ends: 70005 [2025-02-05 12:03:09,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:09,053 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 453 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:09,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 348 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:03:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70005 states. [2025-02-05 12:03:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70005 to 68689. [2025-02-05 12:03:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68689 states, 68688 states have (on average 1.1018372932681109) internal successors, (75683), 68688 states have internal predecessors, (75683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68689 states to 68689 states and 75683 transitions. [2025-02-05 12:03:09,788 INFO L78 Accepts]: Start accepts. Automaton has 68689 states and 75683 transitions. Word has length 434 [2025-02-05 12:03:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:09,789 INFO L471 AbstractCegarLoop]: Abstraction has 68689 states and 75683 transitions. [2025-02-05 12:03:09,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:09,789 INFO L276 IsEmpty]: Start isEmpty. Operand 68689 states and 75683 transitions. [2025-02-05 12:03:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-02-05 12:03:09,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:09,800 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:09,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:03:09,800 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:09,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1378434843, now seen corresponding path program 1 times [2025-02-05 12:03:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:09,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070676293] [2025-02-05 12:03:09,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:09,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-02-05 12:03:09,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-02-05 12:03:09,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:09,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 12:03:09,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070676293] [2025-02-05 12:03:09,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070676293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:09,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:09,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:09,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385996556] [2025-02-05 12:03:09,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:09,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:09,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:09,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:09,952 INFO L87 Difference]: Start difference. First operand 68689 states and 75683 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:12,016 INFO L93 Difference]: Finished difference Result 150579 states and 166092 transitions. [2025-02-05 12:03:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:12,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461 [2025-02-05 12:03:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:12,200 INFO L225 Difference]: With dead ends: 150579 [2025-02-05 12:03:12,200 INFO L226 Difference]: Without dead ends: 81466 [2025-02-05 12:03:12,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:12,224 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 489 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:12,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 301 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:03:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81466 states. [2025-02-05 12:03:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81466 to 62283. [2025-02-05 12:03:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62283 states, 62282 states have (on average 1.1047172537811887) internal successors, (68804), 62282 states have internal predecessors, (68804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62283 states to 62283 states and 68804 transitions. [2025-02-05 12:03:13,230 INFO L78 Accepts]: Start accepts. Automaton has 62283 states and 68804 transitions. Word has length 461 [2025-02-05 12:03:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:13,230 INFO L471 AbstractCegarLoop]: Abstraction has 62283 states and 68804 transitions. [2025-02-05 12:03:13,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 62283 states and 68804 transitions. [2025-02-05 12:03:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 12:03:13,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:13,242 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:13,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:03:13,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:13,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:13,243 INFO L85 PathProgramCache]: Analyzing trace with hash -895463567, now seen corresponding path program 1 times [2025-02-05 12:03:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:13,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520115252] [2025-02-05 12:03:13,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:13,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 12:03:13,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 12:03:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:03:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520115252] [2025-02-05 12:03:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520115252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:14,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405581781] [2025-02-05 12:03:14,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:14,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:14,016 INFO L87 Difference]: Start difference. First operand 62283 states and 68804 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:16,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:16,103 INFO L93 Difference]: Finished difference Result 143293 states and 158065 transitions. [2025-02-05 12:03:16,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:16,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-02-05 12:03:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:16,298 INFO L225 Difference]: With dead ends: 143293 [2025-02-05 12:03:16,299 INFO L226 Difference]: Without dead ends: 80587 [2025-02-05 12:03:16,339 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-05 12:03:16,340 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 662 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:16,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 344 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:03:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80587 states. [2025-02-05 12:03:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80587 to 75895. [2025-02-05 12:03:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75895 states, 75894 states have (on average 1.098057817482278) internal successors, (83336), 75894 states have internal predecessors, (83336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75895 states to 75895 states and 83336 transitions. [2025-02-05 12:03:17,292 INFO L78 Accepts]: Start accepts. Automaton has 75895 states and 83336 transitions. Word has length 473 [2025-02-05 12:03:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 75895 states and 83336 transitions. [2025-02-05 12:03:17,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 75895 states and 83336 transitions. [2025-02-05 12:03:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 12:03:17,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:17,304 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:03:17,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1277732807, now seen corresponding path program 1 times [2025-02-05 12:03:17,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:17,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178246185] [2025-02-05 12:03:17,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:17,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:17,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 12:03:17,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 12:03:17,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:03:17,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178246185] [2025-02-05 12:03:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178246185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095853386] [2025-02-05 12:03:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:17,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:17,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:17,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:17,477 INFO L87 Difference]: Start difference. First operand 75895 states and 83336 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:19,421 INFO L93 Difference]: Finished difference Result 158165 states and 173869 transitions. [2025-02-05 12:03:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:19,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2025-02-05 12:03:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:19,520 INFO L225 Difference]: With dead ends: 158165 [2025-02-05 12:03:19,520 INFO L226 Difference]: Without dead ends: 81846 [2025-02-05 12:03:19,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:19,568 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 475 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:19,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 255 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:03:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81846 states. [2025-02-05 12:03:20,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81846 to 78434. [2025-02-05 12:03:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78434 states, 78433 states have (on average 1.096706743335076) internal successors, (86018), 78433 states have internal predecessors, (86018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78434 states to 78434 states and 86018 transitions. [2025-02-05 12:03:20,576 INFO L78 Accepts]: Start accepts. Automaton has 78434 states and 86018 transitions. Word has length 481 [2025-02-05 12:03:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:20,576 INFO L471 AbstractCegarLoop]: Abstraction has 78434 states and 86018 transitions. [2025-02-05 12:03:20,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:20,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78434 states and 86018 transitions. [2025-02-05 12:03:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 12:03:20,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:20,586 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-05 12:03:20,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:03:20,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -251391696, now seen corresponding path program 1 times [2025-02-05 12:03:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:20,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004819033] [2025-02-05 12:03:20,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 12:03:20,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 12:03:20,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:20,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:03:21,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004819033] [2025-02-05 12:03:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004819033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:21,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702525044] [2025-02-05 12:03:21,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:21,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:21,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:21,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:21,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:21,188 INFO L87 Difference]: Start difference. First operand 78434 states and 86018 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:23,931 INFO L93 Difference]: Finished difference Result 188411 states and 205790 transitions. [2025-02-05 12:03:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:23,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 482 [2025-02-05 12:03:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:24,075 INFO L225 Difference]: With dead ends: 188411 [2025-02-05 12:03:24,075 INFO L226 Difference]: Without dead ends: 104870 [2025-02-05 12:03:24,133 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-05 12:03:24,134 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 752 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:24,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 251 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:03:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104870 states. [2025-02-05 12:03:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104870 to 99292. [2025-02-05 12:03:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99292 states, 99291 states have (on average 1.0917202969050568) internal successors, (108398), 99291 states have internal predecessors, (108398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99292 states to 99292 states and 108398 transitions. [2025-02-05 12:03:25,627 INFO L78 Accepts]: Start accepts. Automaton has 99292 states and 108398 transitions. Word has length 482 [2025-02-05 12:03:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:25,627 INFO L471 AbstractCegarLoop]: Abstraction has 99292 states and 108398 transitions. [2025-02-05 12:03:25,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 99292 states and 108398 transitions. [2025-02-05 12:03:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-02-05 12:03:25,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:25,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:25,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:03:25,638 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:25,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:25,638 INFO L85 PathProgramCache]: Analyzing trace with hash 405563199, now seen corresponding path program 1 times [2025-02-05 12:03:25,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:25,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735583157] [2025-02-05 12:03:25,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:25,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-02-05 12:03:25,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-02-05 12:03:25,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:25,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:03:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735583157] [2025-02-05 12:03:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735583157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047882706] [2025-02-05 12:03:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:26,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:26,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:26,176 INFO L87 Difference]: Start difference. First operand 99292 states and 108398 transitions. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:28,649 INFO L93 Difference]: Finished difference Result 209650 states and 228391 transitions. [2025-02-05 12:03:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 486 [2025-02-05 12:03:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:28,773 INFO L225 Difference]: With dead ends: 209650 [2025-02-05 12:03:28,774 INFO L226 Difference]: Without dead ends: 109935 [2025-02-05 12:03:28,834 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-05 12:03:28,834 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 646 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:28,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 347 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:03:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109935 states. [2025-02-05 12:03:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109935 to 102267. [2025-02-05 12:03:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102267 states, 102266 states have (on average 1.0900788140731035) internal successors, (111478), 102266 states have internal predecessors, (111478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102267 states to 102267 states and 111478 transitions. [2025-02-05 12:03:30,258 INFO L78 Accepts]: Start accepts. Automaton has 102267 states and 111478 transitions. Word has length 486 [2025-02-05 12:03:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 102267 states and 111478 transitions. [2025-02-05 12:03:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 102267 states and 111478 transitions. [2025-02-05 12:03:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-02-05 12:03:30,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:30,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:30,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:03:30,275 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash 185131691, now seen corresponding path program 1 times [2025-02-05 12:03:30,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533457262] [2025-02-05 12:03:30,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:30,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-02-05 12:03:30,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-02-05 12:03:30,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:30,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:03:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:30,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533457262] [2025-02-05 12:03:30,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533457262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:30,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:30,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131530372] [2025-02-05 12:03:30,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:30,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:30,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:30,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:30,872 INFO L87 Difference]: Start difference. First operand 102267 states and 111478 transitions. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:33,383 INFO L93 Difference]: Finished difference Result 234795 states and 255671 transitions. [2025-02-05 12:03:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 494 [2025-02-05 12:03:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:33,543 INFO L225 Difference]: With dead ends: 234795 [2025-02-05 12:03:33,543 INFO L226 Difference]: Without dead ends: 132530 [2025-02-05 12:03:33,604 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-05 12:03:33,605 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 646 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:33,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 169 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:03:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132530 states. [2025-02-05 12:03:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132530 to 123158. [2025-02-05 12:03:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123158 states, 123157 states have (on average 1.0899502261341214) internal successors, (134235), 123157 states have internal predecessors, (134235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123158 states to 123158 states and 134235 transitions. [2025-02-05 12:03:35,266 INFO L78 Accepts]: Start accepts. Automaton has 123158 states and 134235 transitions. Word has length 494 [2025-02-05 12:03:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:35,266 INFO L471 AbstractCegarLoop]: Abstraction has 123158 states and 134235 transitions. [2025-02-05 12:03:35,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 123158 states and 134235 transitions. [2025-02-05 12:03:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-02-05 12:03:35,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:35,278 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:03:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:03:35,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash -695840777, now seen corresponding path program 1 times [2025-02-05 12:03:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895490733] [2025-02-05 12:03:35,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:35,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-02-05 12:03:35,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-02-05 12:03:35,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:35,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:03:36,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:36,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895490733] [2025-02-05 12:03:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895490733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:36,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:36,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:03:36,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370689857] [2025-02-05 12:03:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:36,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:03:36,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:36,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:03:36,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:03:36,385 INFO L87 Difference]: Start difference. First operand 123158 states and 134235 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:39,303 INFO L93 Difference]: Finished difference Result 268457 states and 292245 transitions. [2025-02-05 12:03:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:03:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 529 [2025-02-05 12:03:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:39,474 INFO L225 Difference]: With dead ends: 268457 [2025-02-05 12:03:39,475 INFO L226 Difference]: Without dead ends: 144876 [2025-02-05 12:03:39,506 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-05 12:03:39,507 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 873 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:39,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 266 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:03:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144876 states. [2025-02-05 12:03:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144876 to 126567. [2025-02-05 12:03:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126567 states, 126566 states have (on average 1.0891392633092616) internal successors, (137848), 126566 states have internal predecessors, (137848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126567 states to 126567 states and 137848 transitions. [2025-02-05 12:03:41,112 INFO L78 Accepts]: Start accepts. Automaton has 126567 states and 137848 transitions. Word has length 529 [2025-02-05 12:03:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:41,113 INFO L471 AbstractCegarLoop]: Abstraction has 126567 states and 137848 transitions. [2025-02-05 12:03:41,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 126567 states and 137848 transitions. [2025-02-05 12:03:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-02-05 12:03:41,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:41,126 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:03:41,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:03:41,127 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:41,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash -164981917, now seen corresponding path program 1 times [2025-02-05 12:03:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611522199] [2025-02-05 12:03:41,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:41,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-02-05 12:03:41,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-02-05 12:03:41,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:41,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:03:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611522199] [2025-02-05 12:03:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611522199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908268146] [2025-02-05 12:03:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:41,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:41,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:41,637 INFO L87 Difference]: Start difference. First operand 126567 states and 137848 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:43,605 INFO L93 Difference]: Finished difference Result 266319 states and 289317 transitions. [2025-02-05 12:03:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:43,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2025-02-05 12:03:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:43,766 INFO L225 Difference]: With dead ends: 266319 [2025-02-05 12:03:43,766 INFO L226 Difference]: Without dead ends: 139328 [2025-02-05 12:03:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:43,848 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 437 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 358 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 12:03:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139328 states. [2025-02-05 12:03:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139328 to 124439. [2025-02-05 12:03:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124439 states, 124438 states have (on average 1.0876902553882255) internal successors, (135350), 124438 states have internal predecessors, (135350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124439 states to 124439 states and 135350 transitions. [2025-02-05 12:03:45,500 INFO L78 Accepts]: Start accepts. Automaton has 124439 states and 135350 transitions. Word has length 537 [2025-02-05 12:03:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:45,500 INFO L471 AbstractCegarLoop]: Abstraction has 124439 states and 135350 transitions. [2025-02-05 12:03:45,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 124439 states and 135350 transitions. [2025-02-05 12:03:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-02-05 12:03:45,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:45,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:03:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:03:45,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:45,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -126810660, now seen corresponding path program 1 times [2025-02-05 12:03:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663378034] [2025-02-05 12:03:45,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:45,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-02-05 12:03:45,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-02-05 12:03:45,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:45,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:03:46,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663378034] [2025-02-05 12:03:46,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663378034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:46,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:03:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099132242] [2025-02-05 12:03:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:46,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:46,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:46,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:46,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:46,169 INFO L87 Difference]: Start difference. First operand 124439 states and 135350 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:47,978 INFO L93 Difference]: Finished difference Result 248874 states and 270696 transitions. [2025-02-05 12:03:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:47,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 542 [2025-02-05 12:03:47,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:48,110 INFO L225 Difference]: With dead ends: 248874 [2025-02-05 12:03:48,110 INFO L226 Difference]: Without dead ends: 124436 [2025-02-05 12:03:48,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:48,147 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 590 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:48,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 555 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 12:03:48,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124436 states. [2025-02-05 12:03:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124436 to 124435. [2025-02-05 12:03:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124435 states, 124434 states have (on average 1.0872992911905106) internal successors, (135297), 124434 states have internal predecessors, (135297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124435 states to 124435 states and 135297 transitions. [2025-02-05 12:03:49,321 INFO L78 Accepts]: Start accepts. Automaton has 124435 states and 135297 transitions. Word has length 542 [2025-02-05 12:03:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:49,321 INFO L471 AbstractCegarLoop]: Abstraction has 124435 states and 135297 transitions. [2025-02-05 12:03:49,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 124435 states and 135297 transitions. [2025-02-05 12:03:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-02-05 12:03:49,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:49,331 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:03:49,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:03:49,331 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:49,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash 802163674, now seen corresponding path program 1 times [2025-02-05 12:03:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654355966] [2025-02-05 12:03:49,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:49,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes. [2025-02-05 12:03:49,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements. [2025-02-05 12:03:49,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:49,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-02-05 12:03:49,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654355966] [2025-02-05 12:03:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654355966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:03:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002980682] [2025-02-05 12:03:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:03:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:49,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:03:49,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:03:49,852 INFO L87 Difference]: Start difference. First operand 124435 states and 135297 transitions. Second operand has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:53,430 INFO L93 Difference]: Finished difference Result 308476 states and 335478 transitions. [2025-02-05 12:03:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:03:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 553 [2025-02-05 12:03:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:53,669 INFO L225 Difference]: With dead ends: 308476 [2025-02-05 12:03:53,669 INFO L226 Difference]: Without dead ends: 181068 [2025-02-05 12:03:53,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:03:53,753 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1317 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:53,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 224 Invalid, 3889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 12:03:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181068 states. [2025-02-05 12:03:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181068 to 163620. [2025-02-05 12:03:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163620 states, 163619 states have (on average 1.0788172522751025) internal successors, (176515), 163619 states have internal predecessors, (176515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163620 states to 163620 states and 176515 transitions. [2025-02-05 12:03:55,844 INFO L78 Accepts]: Start accepts. Automaton has 163620 states and 176515 transitions. Word has length 553 [2025-02-05 12:03:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:03:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 163620 states and 176515 transitions. [2025-02-05 12:03:55,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.6) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 163620 states and 176515 transitions. [2025-02-05 12:03:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-02-05 12:03:55,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:03:55,869 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-05 12:03:55,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:03:55,869 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:03:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:03:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2106691812, now seen corresponding path program 1 times [2025-02-05 12:03:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:03:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423234773] [2025-02-05 12:03:55,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:03:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:03:55,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-02-05 12:03:55,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-02-05 12:03:55,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:03:55,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:03:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-05 12:03:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:03:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423234773] [2025-02-05 12:03:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423234773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:03:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:03:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:03:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896065261] [2025-02-05 12:03:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:03:56,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:03:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:03:56,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:03:56,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:56,042 INFO L87 Difference]: Start difference. First operand 163620 states and 176515 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:03:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:03:57,390 INFO L93 Difference]: Finished difference Result 321265 states and 346515 transitions. [2025-02-05 12:03:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:03:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 570 [2025-02-05 12:03:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:03:57,573 INFO L225 Difference]: With dead ends: 321265 [2025-02-05 12:03:57,573 INFO L226 Difference]: Without dead ends: 157647 [2025-02-05 12:03:57,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:03:57,666 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 630 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:03:57,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 103 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 12:03:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157647 states.