./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.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 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:17:27,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:17:27,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:17:27,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:17:27,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:17:27,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:17:27,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:17:27,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:17:27,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:17:27,786 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:17:27,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:17:27,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:17:27,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:17:27,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:17:27,786 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:17:27,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:17:27,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:17:27,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:17:27,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:17:27,788 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:17:27,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:17:27,789 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 -> 71881827e42af7e93d8d7789f21cf70c42c80b5b7128690239afcf02ba9daf37 [2025-02-05 16:17:28,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:17:28,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:17:28,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:17:28,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:17:28,060 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:17:28,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:29,399 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a9760f8b/ac21509d751d409a9f116f3c7d0ec39c/FLAGd89b717cd [2025-02-05 16:17:29,659 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:17:29,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:29,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a9760f8b/ac21509d751d409a9f116f3c7d0ec39c/FLAGd89b717cd [2025-02-05 16:17:29,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a9760f8b/ac21509d751d409a9f116f3c7d0ec39c [2025-02-05 16:17:29,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:17:29,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:17:29,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:17:29,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:17:29,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:17:29,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2c288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29, skipping insertion in model container [2025-02-05 16:17:29,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:17:29,869 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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2025-02-05 16:17:29,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:17:29,879 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:17:29,927 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/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c[15103,15116] [2025-02-05 16:17:29,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:17:29,945 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:17:29,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29 WrapperNode [2025-02-05 16:17:29,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:17:29,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:17:29,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:17:29,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:17:29,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,978 INFO L138 Inliner]: procedures = 26, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 393 [2025-02-05 16:17:29,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:17:29,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:17:29,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:17:29,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:17:29,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:29,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,002 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 16:17:30,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:17:30,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:17:30,012 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:17:30,012 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:17:30,013 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (1/1) ... [2025-02-05 16:17:30,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:17:30,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:30,038 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 16:17:30,040 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 16:17:30,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:17:30,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:17:30,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:17:30,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:17:30,120 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:17:30,121 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:17:30,481 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-05 16:17:30,481 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:17:30,492 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:17:30,492 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:17:30,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:17:30 BoogieIcfgContainer [2025-02-05 16:17:30,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:17:30,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:17:30,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:17:30,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:17:30,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:17:29" (1/3) ... [2025-02-05 16:17:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c528e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:17:30, skipping insertion in model container [2025-02-05 16:17:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:17:29" (2/3) ... [2025-02-05 16:17:30,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c528e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:17:30, skipping insertion in model container [2025-02-05 16:17:30,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:17:30" (3/3) ... [2025-02-05 16:17:30,499 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c [2025-02-05 16:17:30,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:17:30,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c that has 1 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:17:30,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:17:30,553 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;@25508f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:17:30,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:17:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 97 states have (on average 1.7628865979381443) internal successors, (171), 98 states have internal predecessors, (171), 0 states have call successors, (0), 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 16:17:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:17:30,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:30,560 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] [2025-02-05 16:17:30,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:30,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1247818815, now seen corresponding path program 1 times [2025-02-05 16:17:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:30,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891718149] [2025-02-05 16:17:30,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:30,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:17:30,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:17:30,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:30,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:30,757 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 16:17:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:30,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891718149] [2025-02-05 16:17:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891718149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:17:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367271377] [2025-02-05 16:17:30,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:30,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:17:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:30,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:17:30,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:17:30,774 INFO L87 Difference]: Start difference. First operand has 99 states, 97 states have (on average 1.7628865979381443) internal successors, (171), 98 states have internal predecessors, (171), 0 states have call successors, (0), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 16:17:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:30,791 INFO L93 Difference]: Finished difference Result 150 states and 254 transitions. [2025-02-05 16:17:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:17:30,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 16:17:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:30,801 INFO L225 Difference]: With dead ends: 150 [2025-02-05 16:17:30,801 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 16:17:30,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:17:30,806 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:30,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:30,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 16:17:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-05 16:17:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.7473684210526317) internal successors, (166), 95 states have internal predecessors, (166), 0 states have call successors, (0), 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 16:17:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 166 transitions. [2025-02-05 16:17:30,841 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 166 transitions. Word has length 25 [2025-02-05 16:17:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:30,841 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 166 transitions. [2025-02-05 16:17:30,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 16:17:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 166 transitions. [2025-02-05 16:17:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 16:17:30,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:30,842 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] [2025-02-05 16:17:30,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:17:30,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:30,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:30,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1656643040, now seen corresponding path program 1 times [2025-02-05 16:17:30,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:30,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670125894] [2025-02-05 16:17:30,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:30,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:30,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 16:17:30,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 16:17:30,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:30,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:31,065 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 16:17:31,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:31,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670125894] [2025-02-05 16:17:31,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670125894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:31,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:31,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:17:31,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125879538] [2025-02-05 16:17:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:17:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:31,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:17:31,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:31,067 INFO L87 Difference]: Start difference. First operand 96 states and 166 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 16:17:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:31,122 INFO L93 Difference]: Finished difference Result 150 states and 250 transitions. [2025-02-05 16:17:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:17:31,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-02-05 16:17:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:31,124 INFO L225 Difference]: With dead ends: 150 [2025-02-05 16:17:31,124 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 16:17:31,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:31,125 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:31,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 16:17:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-05 16:17:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2025-02-05 16:17:31,135 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 25 [2025-02-05 16:17:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2025-02-05 16:17:31,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 16:17:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2025-02-05 16:17:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:17:31,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:31,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:31,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:17:31,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:31,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash 676222151, now seen corresponding path program 1 times [2025-02-05 16:17:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:31,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563710847] [2025-02-05 16:17:31,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:31,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:17:31,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:17:31,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:31,363 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 16:17:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563710847] [2025-02-05 16:17:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563710847] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446945139] [2025-02-05 16:17:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:31,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:31,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:31,367 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 16:17:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:31,726 INFO L93 Difference]: Finished difference Result 696 states and 1086 transitions. [2025-02-05 16:17:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:17:31,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:17:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:31,731 INFO L225 Difference]: With dead ends: 696 [2025-02-05 16:17:31,731 INFO L226 Difference]: Without dead ends: 646 [2025-02-05 16:17:31,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:17:31,732 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1095 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:31,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 2088 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:17:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-05 16:17:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 144. [2025-02-05 16:17:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 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 16:17:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2025-02-05 16:17:31,750 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 64 [2025-02-05 16:17:31,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:31,750 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2025-02-05 16:17:31,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 16:17:31,750 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2025-02-05 16:17:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:17:31,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:31,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:31,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:17:31,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:31,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:31,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1865188670, now seen corresponding path program 1 times [2025-02-05 16:17:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:31,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244180617] [2025-02-05 16:17:31,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:31,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:17:31,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:17:31,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:31,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:31,892 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 16:17:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244180617] [2025-02-05 16:17:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244180617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:31,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:31,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682881112] [2025-02-05 16:17:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:31,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:31,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:31,894 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 16:17:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:31,924 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2025-02-05 16:17:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:31,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:17:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:31,930 INFO L225 Difference]: With dead ends: 329 [2025-02-05 16:17:31,930 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 16:17:31,934 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 16:17:31,934 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 53 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:31,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 195 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 16:17:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2025-02-05 16:17:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4734513274336283) internal successors, (333), 226 states have internal predecessors, (333), 0 states have call successors, (0), 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 16:17:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 333 transitions. [2025-02-05 16:17:31,949 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 333 transitions. Word has length 66 [2025-02-05 16:17:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 333 transitions. [2025-02-05 16:17:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 16:17:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 333 transitions. [2025-02-05 16:17:31,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:17:31,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:31,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:31,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:17:31,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:31,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:31,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1832865435, now seen corresponding path program 1 times [2025-02-05 16:17:31,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:31,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298010392] [2025-02-05 16:17:31,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:31,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:31,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:17:31,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:17:31,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:31,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:32,238 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 16:17:32,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:32,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298010392] [2025-02-05 16:17:32,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298010392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:32,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:32,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:32,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128837613] [2025-02-05 16:17:32,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:32,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:32,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:32,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:32,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:32,240 INFO L87 Difference]: Start difference. First operand 227 states and 333 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 16:17:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:32,438 INFO L93 Difference]: Finished difference Result 410 states and 621 transitions. [2025-02-05 16:17:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:32,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:17:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:32,440 INFO L225 Difference]: With dead ends: 410 [2025-02-05 16:17:32,440 INFO L226 Difference]: Without dead ends: 229 [2025-02-05 16:17:32,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:17:32,441 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 264 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:32,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 505 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-05 16:17:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2025-02-05 16:17:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4646017699115044) internal successors, (331), 226 states have internal predecessors, (331), 0 states have call successors, (0), 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 16:17:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 331 transitions. [2025-02-05 16:17:32,456 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 331 transitions. Word has length 66 [2025-02-05 16:17:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:32,456 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 331 transitions. [2025-02-05 16:17:32,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 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 16:17:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 331 transitions. [2025-02-05 16:17:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:17:32,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:32,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:32,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:17:32,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:32,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:32,460 INFO L85 PathProgramCache]: Analyzing trace with hash -953715904, now seen corresponding path program 1 times [2025-02-05 16:17:32,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:32,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438595513] [2025-02-05 16:17:32,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:32,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:32,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:17:32,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:17:32,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:32,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:32,705 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 16:17:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438595513] [2025-02-05 16:17:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438595513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:32,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:17:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325648328] [2025-02-05 16:17:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:32,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:17:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:17:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:32,710 INFO L87 Difference]: Start difference. First operand 227 states and 331 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 16:17:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:32,731 INFO L93 Difference]: Finished difference Result 235 states and 340 transitions. [2025-02-05 16:17:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:17:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:17:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:32,733 INFO L225 Difference]: With dead ends: 235 [2025-02-05 16:17:32,734 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 16:17:32,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:17:32,735 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:32,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 16:17:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-02-05 16:17:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.4482758620689655) internal successors, (336), 232 states have internal predecessors, (336), 0 states have call successors, (0), 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 16:17:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 336 transitions. [2025-02-05 16:17:32,747 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 336 transitions. Word has length 67 [2025-02-05 16:17:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:32,749 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 336 transitions. [2025-02-05 16:17:32,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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 16:17:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 336 transitions. [2025-02-05 16:17:32,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:17:32,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:32,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:32,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:17:32,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:32,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:32,751 INFO L85 PathProgramCache]: Analyzing trace with hash -114976157, now seen corresponding path program 1 times [2025-02-05 16:17:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673442562] [2025-02-05 16:17:32,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:32,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:17:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:17:32,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:32,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:32,825 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 16:17:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673442562] [2025-02-05 16:17:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673442562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18287321] [2025-02-05 16:17:32,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:32,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:32,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:32,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:32,827 INFO L87 Difference]: Start difference. First operand 233 states and 336 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:32,847 INFO L93 Difference]: Finished difference Result 591 states and 888 transitions. [2025-02-05 16:17:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:32,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:17:32,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:32,850 INFO L225 Difference]: With dead ends: 591 [2025-02-05 16:17:32,852 INFO L226 Difference]: Without dead ends: 404 [2025-02-05 16:17:32,853 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 16:17:32,853 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:32,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 268 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-05 16:17:32,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2025-02-05 16:17:32,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 1.4788029925187032) internal successors, (593), 401 states have internal predecessors, (593), 0 states have call successors, (0), 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 16:17:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 593 transitions. [2025-02-05 16:17:32,866 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 593 transitions. Word has length 68 [2025-02-05 16:17:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:32,868 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 593 transitions. [2025-02-05 16:17:32,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 593 transitions. [2025-02-05 16:17:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:17:32,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:32,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:32,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:17:32,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:32,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:32,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1093906653, now seen corresponding path program 1 times [2025-02-05 16:17:32,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:32,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138467859] [2025-02-05 16:17:32,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:32,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:32,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:17:32,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:17:32,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:32,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:32,937 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 16:17:32,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138467859] [2025-02-05 16:17:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138467859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117492403] [2025-02-05 16:17:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:32,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:32,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:32,939 INFO L87 Difference]: Start difference. First operand 402 states and 593 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:32,962 INFO L93 Difference]: Finished difference Result 1082 states and 1631 transitions. [2025-02-05 16:17:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:17:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:32,965 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 16:17:32,966 INFO L226 Difference]: Without dead ends: 726 [2025-02-05 16:17:32,966 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 16:17:32,967 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 66 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:32,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 270 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-05 16:17:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 724. [2025-02-05 16:17:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 1.4868603042876902) internal successors, (1075), 723 states have internal predecessors, (1075), 0 states have call successors, (0), 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 16:17:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1075 transitions. [2025-02-05 16:17:33,003 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1075 transitions. Word has length 68 [2025-02-05 16:17:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:33,003 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1075 transitions. [2025-02-05 16:17:33,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1075 transitions. [2025-02-05 16:17:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:17:33,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:33,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:33,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:17:33,004 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:33,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:33,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1541852189, now seen corresponding path program 1 times [2025-02-05 16:17:33,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604076556] [2025-02-05 16:17:33,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:33,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:17:33,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:17:33,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:33,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:33,064 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 16:17:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:33,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604076556] [2025-02-05 16:17:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604076556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626111142] [2025-02-05 16:17:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:33,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:33,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:33,066 INFO L87 Difference]: Start difference. First operand 724 states and 1075 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:33,089 INFO L93 Difference]: Finished difference Result 2016 states and 3021 transitions. [2025-02-05 16:17:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:17:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:33,094 INFO L225 Difference]: With dead ends: 2016 [2025-02-05 16:17:33,094 INFO L226 Difference]: Without dead ends: 1338 [2025-02-05 16:17:33,095 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 16:17:33,095 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 64 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:33,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 272 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-02-05 16:17:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1336. [2025-02-05 16:17:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1335 states have (on average 1.4794007490636705) internal successors, (1975), 1335 states have internal predecessors, (1975), 0 states have call successors, (0), 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 16:17:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1975 transitions. [2025-02-05 16:17:33,126 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1975 transitions. Word has length 68 [2025-02-05 16:17:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:33,126 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1975 transitions. [2025-02-05 16:17:33,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1975 transitions. [2025-02-05 16:17:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:17:33,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:33,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:33,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:17:33,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:33,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1126676317, now seen corresponding path program 1 times [2025-02-05 16:17:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760039000] [2025-02-05 16:17:33,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:33,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:17:33,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:17:33,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:33,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:33,177 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 16:17:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:33,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760039000] [2025-02-05 16:17:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760039000] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231799536] [2025-02-05 16:17:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:33,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:33,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:33,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:33,178 INFO L87 Difference]: Start difference. First operand 1336 states and 1975 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:33,225 INFO L93 Difference]: Finished difference Result 3788 states and 5609 transitions. [2025-02-05 16:17:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:17:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:33,233 INFO L225 Difference]: With dead ends: 3788 [2025-02-05 16:17:33,233 INFO L226 Difference]: Without dead ends: 2498 [2025-02-05 16:17:33,236 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 16:17:33,237 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 62 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:33,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 274 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2025-02-05 16:17:33,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2496. [2025-02-05 16:17:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.4617234468937876) internal successors, (3647), 2495 states have internal predecessors, (3647), 0 states have call successors, (0), 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 16:17:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3647 transitions. [2025-02-05 16:17:33,298 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3647 transitions. Word has length 68 [2025-02-05 16:17:33,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:33,299 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3647 transitions. [2025-02-05 16:17:33,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3647 transitions. [2025-02-05 16:17:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:17:33,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:33,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:33,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:17:33,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:33,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1613394589, now seen corresponding path program 1 times [2025-02-05 16:17:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:33,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951434354] [2025-02-05 16:17:33,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:33,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:17:33,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:17:33,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:33,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:33,345 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 16:17:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951434354] [2025-02-05 16:17:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951434354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606696962] [2025-02-05 16:17:33,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:33,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:33,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:33,348 INFO L87 Difference]: Start difference. First operand 2496 states and 3647 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:33,414 INFO L93 Difference]: Finished difference Result 7140 states and 10401 transitions. [2025-02-05 16:17:33,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:33,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:17:33,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:33,428 INFO L225 Difference]: With dead ends: 7140 [2025-02-05 16:17:33,429 INFO L226 Difference]: Without dead ends: 4690 [2025-02-05 16:17:33,434 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 16:17:33,435 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 60 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:33,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 276 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4690 states. [2025-02-05 16:17:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4690 to 4688. [2025-02-05 16:17:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4687 states have (on average 1.4369532750160017) internal successors, (6735), 4687 states have internal predecessors, (6735), 0 states have call successors, (0), 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 16:17:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 6735 transitions. [2025-02-05 16:17:33,587 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 6735 transitions. Word has length 68 [2025-02-05 16:17:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:33,587 INFO L471 AbstractCegarLoop]: Abstraction has 4688 states and 6735 transitions. [2025-02-05 16:17:33,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 16:17:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 6735 transitions. [2025-02-05 16:17:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:17:33,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:33,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:33,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:17:33,591 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:33,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1215714269, now seen corresponding path program 1 times [2025-02-05 16:17:33,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457543484] [2025-02-05 16:17:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:33,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:17:33,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:17:33,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:33,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:33,645 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 16:17:33,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:33,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457543484] [2025-02-05 16:17:33,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457543484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:33,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:33,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:33,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703170816] [2025-02-05 16:17:33,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:33,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:33,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:33,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:33,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:33,647 INFO L87 Difference]: Start difference. First operand 4688 states and 6735 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 16:17:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:33,732 INFO L93 Difference]: Finished difference Result 9559 states and 13845 transitions. [2025-02-05 16:17:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:33,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:17:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:33,753 INFO L225 Difference]: With dead ends: 9559 [2025-02-05 16:17:33,754 INFO L226 Difference]: Without dead ends: 6932 [2025-02-05 16:17:33,759 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 16:17:33,759 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:33,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6932 states. [2025-02-05 16:17:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6932 to 6930. [2025-02-05 16:17:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6930 states, 6929 states have (on average 1.4294992062346659) internal successors, (9905), 6929 states have internal predecessors, (9905), 0 states have call successors, (0), 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 16:17:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 9905 transitions. [2025-02-05 16:17:33,988 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 9905 transitions. Word has length 70 [2025-02-05 16:17:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:33,988 INFO L471 AbstractCegarLoop]: Abstraction has 6930 states and 9905 transitions. [2025-02-05 16:17:33,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 16:17:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 9905 transitions. [2025-02-05 16:17:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:17:33,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:33,994 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:33,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:17:33,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:33,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1779286253, now seen corresponding path program 1 times [2025-02-05 16:17:33,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:33,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895024346] [2025-02-05 16:17:33,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:34,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:17:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:17:34,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:34,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:17:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895024346] [2025-02-05 16:17:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895024346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:34,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:34,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345348507] [2025-02-05 16:17:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:34,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:34,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:34,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:34,142 INFO L87 Difference]: Start difference. First operand 6930 states and 9905 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:34,834 INFO L93 Difference]: Finished difference Result 49664 states and 71032 transitions. [2025-02-05 16:17:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-02-05 16:17:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:34,935 INFO L225 Difference]: With dead ends: 49664 [2025-02-05 16:17:34,935 INFO L226 Difference]: Without dead ends: 42782 [2025-02-05 16:17:34,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:34,956 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 858 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:34,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1165 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42782 states. [2025-02-05 16:17:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42782 to 13810. [2025-02-05 16:17:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13810 states, 13809 states have (on average 1.4240712578752988) internal successors, (19665), 13809 states have internal predecessors, (19665), 0 states have call successors, (0), 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 16:17:35,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13810 states to 13810 states and 19665 transitions. [2025-02-05 16:17:35,517 INFO L78 Accepts]: Start accepts. Automaton has 13810 states and 19665 transitions. Word has length 89 [2025-02-05 16:17:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:35,517 INFO L471 AbstractCegarLoop]: Abstraction has 13810 states and 19665 transitions. [2025-02-05 16:17:35,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13810 states and 19665 transitions. [2025-02-05 16:17:35,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:17:35,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:35,520 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:35,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:17:35,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:35,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:35,521 INFO L85 PathProgramCache]: Analyzing trace with hash 800355757, now seen corresponding path program 1 times [2025-02-05 16:17:35,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:35,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220952353] [2025-02-05 16:17:35,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:35,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:17:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:17:35,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:35,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:17:35,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:35,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220952353] [2025-02-05 16:17:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220952353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109286894] [2025-02-05 16:17:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:35,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:35,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:35,697 INFO L87 Difference]: Start difference. First operand 13810 states and 19665 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 16:17:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:36,396 INFO L93 Difference]: Finished difference Result 56544 states and 80792 transitions. [2025-02-05 16:17:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:36,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 89 [2025-02-05 16:17:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:36,480 INFO L225 Difference]: With dead ends: 56544 [2025-02-05 16:17:36,480 INFO L226 Difference]: Without dead ends: 49662 [2025-02-05 16:17:36,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:36,496 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 883 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:36,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1058 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49662 states. [2025-02-05 16:17:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49662 to 24146. [2025-02-05 16:17:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24146 states, 24145 states have (on average 1.417477738662249) internal successors, (34225), 24145 states have internal predecessors, (34225), 0 states have call successors, (0), 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 16:17:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24146 states to 24146 states and 34225 transitions. [2025-02-05 16:17:37,272 INFO L78 Accepts]: Start accepts. Automaton has 24146 states and 34225 transitions. Word has length 89 [2025-02-05 16:17:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:37,272 INFO L471 AbstractCegarLoop]: Abstraction has 24146 states and 34225 transitions. [2025-02-05 16:17:37,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 16:17:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 24146 states and 34225 transitions. [2025-02-05 16:17:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:17:37,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:37,276 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:17:37,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:37,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:37,276 INFO L85 PathProgramCache]: Analyzing trace with hash 352410221, now seen corresponding path program 1 times [2025-02-05 16:17:37,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378376753] [2025-02-05 16:17:37,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:37,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:17:37,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:17:37,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:37,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:17:37,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:37,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378376753] [2025-02-05 16:17:37,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378376753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:37,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:37,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:37,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30985891] [2025-02-05 16:17:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:37,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:37,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:37,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:37,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:37,474 INFO L87 Difference]: Start difference. First operand 24146 states and 34225 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 16:17:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:38,407 INFO L93 Difference]: Finished difference Result 63424 states and 90552 transitions. [2025-02-05 16:17:38,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 89 [2025-02-05 16:17:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:38,525 INFO L225 Difference]: With dead ends: 63424 [2025-02-05 16:17:38,526 INFO L226 Difference]: Without dead ends: 56542 [2025-02-05 16:17:38,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:38,721 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 920 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:38,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1036 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56542 states. [2025-02-05 16:17:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56542 to 31026. [2025-02-05 16:17:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31026 states, 31025 states have (on average 1.4177276390008058) internal successors, (43985), 31025 states have internal predecessors, (43985), 0 states have call successors, (0), 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 16:17:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31026 states to 31026 states and 43985 transitions. [2025-02-05 16:17:39,476 INFO L78 Accepts]: Start accepts. Automaton has 31026 states and 43985 transitions. Word has length 89 [2025-02-05 16:17:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:39,477 INFO L471 AbstractCegarLoop]: Abstraction has 31026 states and 43985 transitions. [2025-02-05 16:17:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 16:17:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 31026 states and 43985 transitions. [2025-02-05 16:17:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:17:39,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:39,480 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:39,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:17:39,480 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 767586093, now seen corresponding path program 1 times [2025-02-05 16:17:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:39,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442119001] [2025-02-05 16:17:39,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:39,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:17:39,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:17:39,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:39,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:17:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:39,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442119001] [2025-02-05 16:17:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442119001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943783322] [2025-02-05 16:17:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:39,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:39,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:39,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:39,612 INFO L87 Difference]: Start difference. First operand 31026 states and 43985 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 16:17:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:40,860 INFO L93 Difference]: Finished difference Result 70304 states and 100312 transitions. [2025-02-05 16:17:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:40,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 89 [2025-02-05 16:17:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:40,945 INFO L225 Difference]: With dead ends: 70304 [2025-02-05 16:17:40,945 INFO L226 Difference]: Without dead ends: 63422 [2025-02-05 16:17:40,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:40,962 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 977 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:40,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1017 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63422 states. [2025-02-05 16:17:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63422 to 37906. [2025-02-05 16:17:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37906 states, 37905 states have (on average 1.4178868223189554) internal successors, (53745), 37905 states have internal predecessors, (53745), 0 states have call successors, (0), 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 16:17:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37906 states to 37906 states and 53745 transitions. [2025-02-05 16:17:42,049 INFO L78 Accepts]: Start accepts. Automaton has 37906 states and 53745 transitions. Word has length 89 [2025-02-05 16:17:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:42,049 INFO L471 AbstractCegarLoop]: Abstraction has 37906 states and 53745 transitions. [2025-02-05 16:17:42,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 16:17:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 37906 states and 53745 transitions. [2025-02-05 16:17:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:17:42,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:42,052 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:17:42,052 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 280867821, now seen corresponding path program 1 times [2025-02-05 16:17:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:42,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428958112] [2025-02-05 16:17:42,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:42,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:17:42,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:17:42,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:42,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:17:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428958112] [2025-02-05 16:17:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428958112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:42,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804823547] [2025-02-05 16:17:42,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:42,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:42,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:42,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:42,191 INFO L87 Difference]: Start difference. First operand 37906 states and 53745 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 16:17:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:43,339 INFO L93 Difference]: Finished difference Result 77184 states and 110072 transitions. [2025-02-05 16:17:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 89 [2025-02-05 16:17:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:43,426 INFO L225 Difference]: With dead ends: 77184 [2025-02-05 16:17:43,427 INFO L226 Difference]: Without dead ends: 70302 [2025-02-05 16:17:43,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:43,450 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 877 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:43,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1110 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70302 states. [2025-02-05 16:17:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70302 to 44786. [2025-02-05 16:17:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44786 states, 44785 states have (on average 1.4179970972423803) internal successors, (63505), 44785 states have internal predecessors, (63505), 0 states have call successors, (0), 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 16:17:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44786 states to 44786 states and 63505 transitions. [2025-02-05 16:17:44,795 INFO L78 Accepts]: Start accepts. Automaton has 44786 states and 63505 transitions. Word has length 89 [2025-02-05 16:17:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 44786 states and 63505 transitions. [2025-02-05 16:17:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 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 16:17:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 44786 states and 63505 transitions. [2025-02-05 16:17:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:17:44,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:44,800 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:44,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:17:44,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:44,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1649781771, now seen corresponding path program 1 times [2025-02-05 16:17:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055665675] [2025-02-05 16:17:44,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:44,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:17:44,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:17:44,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055665675] [2025-02-05 16:17:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055665675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:44,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:44,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:44,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479926062] [2025-02-05 16:17:44,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:44,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:44,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:44,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:44,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:44,895 INFO L87 Difference]: Start difference. First operand 44786 states and 63505 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 16:17:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:45,611 INFO L93 Difference]: Finished difference Result 76428 states and 108874 transitions. [2025-02-05 16:17:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 16:17:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:45,651 INFO L225 Difference]: With dead ends: 76428 [2025-02-05 16:17:45,651 INFO L226 Difference]: Without dead ends: 31690 [2025-02-05 16:17:45,681 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 16:17:45,682 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 58 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:45,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 285 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31690 states. [2025-02-05 16:17:46,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31690 to 31688. [2025-02-05 16:17:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31688 states, 31687 states have (on average 1.4201091930444663) internal successors, (44999), 31687 states have internal predecessors, (44999), 0 states have call successors, (0), 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 16:17:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31688 states to 31688 states and 44999 transitions. [2025-02-05 16:17:46,402 INFO L78 Accepts]: Start accepts. Automaton has 31688 states and 44999 transitions. Word has length 91 [2025-02-05 16:17:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:46,402 INFO L471 AbstractCegarLoop]: Abstraction has 31688 states and 44999 transitions. [2025-02-05 16:17:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 16:17:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31688 states and 44999 transitions. [2025-02-05 16:17:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:17:46,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:46,404 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:17:46,404 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1895671763, now seen corresponding path program 1 times [2025-02-05 16:17:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541558736] [2025-02-05 16:17:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:46,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:17:46,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:17:46,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:46,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:17:46,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:46,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541558736] [2025-02-05 16:17:46,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541558736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:46,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:46,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:17:46,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758151309] [2025-02-05 16:17:46,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:46,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:17:46,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:46,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:17:46,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:17:46,551 INFO L87 Difference]: Start difference. First operand 31688 states and 44999 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 16:17:47,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:47,346 INFO L93 Difference]: Finished difference Result 60886 states and 86862 transitions. [2025-02-05 16:17:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:17:47,346 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 91 [2025-02-05 16:17:47,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:47,416 INFO L225 Difference]: With dead ends: 60886 [2025-02-05 16:17:47,416 INFO L226 Difference]: Without dead ends: 56020 [2025-02-05 16:17:47,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:47,431 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 863 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:47,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1319 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:17:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56020 states. [2025-02-05 16:17:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56020 to 36552. [2025-02-05 16:17:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36552 states, 36551 states have (on average 1.4202347404995759) internal successors, (51911), 36551 states have internal predecessors, (51911), 0 states have call successors, (0), 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 16:17:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36552 states to 36552 states and 51911 transitions. [2025-02-05 16:17:48,537 INFO L78 Accepts]: Start accepts. Automaton has 36552 states and 51911 transitions. Word has length 91 [2025-02-05 16:17:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:48,538 INFO L471 AbstractCegarLoop]: Abstraction has 36552 states and 51911 transitions. [2025-02-05 16:17:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 16:17:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 36552 states and 51911 transitions. [2025-02-05 16:17:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:17:48,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:48,541 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:48,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:17:48,541 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:48,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1454396736, now seen corresponding path program 1 times [2025-02-05 16:17:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265527085] [2025-02-05 16:17:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:17:48,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:17:48,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265527085] [2025-02-05 16:17:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265527085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885025687] [2025-02-05 16:17:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:48,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:48,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:48,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:48,627 INFO L87 Difference]: Start difference. First operand 36552 states and 51911 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 16:17:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:49,052 INFO L93 Difference]: Finished difference Result 54796 states and 77833 transitions. [2025-02-05 16:17:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 16:17:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:49,078 INFO L225 Difference]: With dead ends: 54796 [2025-02-05 16:17:49,079 INFO L226 Difference]: Without dead ends: 18314 [2025-02-05 16:17:49,103 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 16:17:49,104 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 53 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:49,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 270 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2025-02-05 16:17:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 18312. [2025-02-05 16:17:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18312 states, 18311 states have (on average 1.4063131451040358) internal successors, (25751), 18311 states have internal predecessors, (25751), 0 states have call successors, (0), 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 16:17:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18312 states to 18312 states and 25751 transitions. [2025-02-05 16:17:49,608 INFO L78 Accepts]: Start accepts. Automaton has 18312 states and 25751 transitions. Word has length 92 [2025-02-05 16:17:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:49,610 INFO L471 AbstractCegarLoop]: Abstraction has 18312 states and 25751 transitions. [2025-02-05 16:17:49,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 16:17:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18312 states and 25751 transitions. [2025-02-05 16:17:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:17:49,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:49,612 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:49,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:17:49,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:49,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:49,613 INFO L85 PathProgramCache]: Analyzing trace with hash 250378663, now seen corresponding path program 1 times [2025-02-05 16:17:49,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:49,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001779694] [2025-02-05 16:17:49,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:49,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:17:49,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:17:49,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:49,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001779694] [2025-02-05 16:17:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001779694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791403464] [2025-02-05 16:17:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:49,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:49,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:49,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:49,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:49,697 INFO L87 Difference]: Start difference. First operand 18312 states and 25751 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 16:17:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:49,901 INFO L93 Difference]: Finished difference Result 27436 states and 38593 transitions. [2025-02-05 16:17:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:17:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:49,912 INFO L225 Difference]: With dead ends: 27436 [2025-02-05 16:17:49,912 INFO L226 Difference]: Without dead ends: 9194 [2025-02-05 16:17:49,924 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 16:17:49,925 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:49,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 255 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2025-02-05 16:17:50,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 9192. [2025-02-05 16:17:50,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9192 states, 9191 states have (on average 1.3916875204003918) internal successors, (12791), 9191 states have internal predecessors, (12791), 0 states have call successors, (0), 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 16:17:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9192 states to 9192 states and 12791 transitions. [2025-02-05 16:17:50,208 INFO L78 Accepts]: Start accepts. Automaton has 9192 states and 12791 transitions. Word has length 94 [2025-02-05 16:17:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:50,208 INFO L471 AbstractCegarLoop]: Abstraction has 9192 states and 12791 transitions. [2025-02-05 16:17:50,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 16:17:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9192 states and 12791 transitions. [2025-02-05 16:17:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:17:50,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:50,209 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:50,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:17:50,209 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:50,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash 304863022, now seen corresponding path program 1 times [2025-02-05 16:17:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306433594] [2025-02-05 16:17:50,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:50,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:17:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:17:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306433594] [2025-02-05 16:17:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306433594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945946425] [2025-02-05 16:17:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:50,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:50,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:50,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:50,291 INFO L87 Difference]: Start difference. First operand 9192 states and 12791 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 16:17:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:50,360 INFO L93 Difference]: Finished difference Result 13756 states and 19153 transitions. [2025-02-05 16:17:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:50,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-05 16:17:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:50,368 INFO L225 Difference]: With dead ends: 13756 [2025-02-05 16:17:50,368 INFO L226 Difference]: Without dead ends: 4634 [2025-02-05 16:17:50,373 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 16:17:50,375 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 47 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:50,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 240 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2025-02-05 16:17:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4632. [2025-02-05 16:17:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4632 states, 4631 states have (on average 1.3757287842798531) internal successors, (6371), 4631 states have internal predecessors, (6371), 0 states have call successors, (0), 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 16:17:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 6371 transitions. [2025-02-05 16:17:50,455 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 6371 transitions. Word has length 96 [2025-02-05 16:17:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 4632 states and 6371 transitions. [2025-02-05 16:17:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 16:17:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 6371 transitions. [2025-02-05 16:17:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:17:50,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:50,456 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:50,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:17:50,456 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:50,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash -544940587, now seen corresponding path program 1 times [2025-02-05 16:17:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:50,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434884649] [2025-02-05 16:17:50,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:50,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:50,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:17:50,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:17:50,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:50,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434884649] [2025-02-05 16:17:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434884649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528250118] [2025-02-05 16:17:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:50,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:50,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:50,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:50,525 INFO L87 Difference]: Start difference. First operand 4632 states and 6371 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 16:17:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:50,571 INFO L93 Difference]: Finished difference Result 6916 states and 9523 transitions. [2025-02-05 16:17:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:50,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-02-05 16:17:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:50,576 INFO L225 Difference]: With dead ends: 6916 [2025-02-05 16:17:50,577 INFO L226 Difference]: Without dead ends: 2354 [2025-02-05 16:17:50,580 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 16:17:50,580 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 44 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:50,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 225 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-02-05 16:17:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2352. [2025-02-05 16:17:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 1.3572947681837515) internal successors, (3191), 2351 states have internal predecessors, (3191), 0 states have call successors, (0), 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 16:17:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3191 transitions. [2025-02-05 16:17:50,622 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3191 transitions. Word has length 98 [2025-02-05 16:17:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:50,622 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3191 transitions. [2025-02-05 16:17:50,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 16:17:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3191 transitions. [2025-02-05 16:17:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:17:50,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:50,623 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:50,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:17:50,623 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:50,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1021312412, now seen corresponding path program 1 times [2025-02-05 16:17:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196576213] [2025-02-05 16:17:50,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:50,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:17:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:17:50,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196576213] [2025-02-05 16:17:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196576213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:17:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:17:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:17:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190864708] [2025-02-05 16:17:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:17:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:17:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:50,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:17:50,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:17:50,688 INFO L87 Difference]: Start difference. First operand 2352 states and 3191 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 16:17:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:50,712 INFO L93 Difference]: Finished difference Result 3496 states and 4753 transitions. [2025-02-05 16:17:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:17:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-02-05 16:17:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:50,715 INFO L225 Difference]: With dead ends: 3496 [2025-02-05 16:17:50,715 INFO L226 Difference]: Without dead ends: 1214 [2025-02-05 16:17:50,716 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 16:17:50,717 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:50,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 210 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:17:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2025-02-05 16:17:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1212. [2025-02-05 16:17:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 1.3344343517753923) internal successors, (1616), 1211 states have internal predecessors, (1616), 0 states have call successors, (0), 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 16:17:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1616 transitions. [2025-02-05 16:17:50,737 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1616 transitions. Word has length 100 [2025-02-05 16:17:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:50,737 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1616 transitions. [2025-02-05 16:17:50,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 16:17:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1616 transitions. [2025-02-05 16:17:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:17:50,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:50,738 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:50,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:17:50,738 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1644714365, now seen corresponding path program 1 times [2025-02-05 16:17:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:50,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106621599] [2025-02-05 16:17:50,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:17:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:17:50,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:51,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106621599] [2025-02-05 16:17:51,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106621599] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:17:51,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994604711] [2025-02-05 16:17:51,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:51,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:51,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:51,349 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 16:17:51,350 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 16:17:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:17:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:17:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:51,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:17:51,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:17:51,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:17:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:17:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994604711] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:17:51,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:17:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-02-05 16:17:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058999723] [2025-02-05 16:17:51,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:17:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:17:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:17:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:17:51,886 INFO L87 Difference]: Start difference. First operand 1212 states and 1616 transitions. Second operand has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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 16:17:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:54,069 INFO L93 Difference]: Finished difference Result 8791 states and 11735 transitions. [2025-02-05 16:17:54,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-05 16:17:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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 102 [2025-02-05 16:17:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:54,078 INFO L225 Difference]: With dead ends: 8791 [2025-02-05 16:17:54,078 INFO L226 Difference]: Without dead ends: 7649 [2025-02-05 16:17:54,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=699, Invalid=3083, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 16:17:54,081 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1589 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:54,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1171 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:17:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2025-02-05 16:17:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7597. [2025-02-05 16:17:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7597 states, 7596 states have (on average 1.2844918378093733) internal successors, (9757), 7596 states have internal predecessors, (9757), 0 states have call successors, (0), 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 16:17:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7597 states to 7597 states and 9757 transitions. [2025-02-05 16:17:54,227 INFO L78 Accepts]: Start accepts. Automaton has 7597 states and 9757 transitions. Word has length 102 [2025-02-05 16:17:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:54,227 INFO L471 AbstractCegarLoop]: Abstraction has 7597 states and 9757 transitions. [2025-02-05 16:17:54,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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 16:17:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7597 states and 9757 transitions. [2025-02-05 16:17:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:17:54,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:54,228 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:54,235 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 16:17:54,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-05 16:17:54,432 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1881795219, now seen corresponding path program 1 times [2025-02-05 16:17:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:54,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099949267] [2025-02-05 16:17:54,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:54,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:54,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:54,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:54,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:54,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099949267] [2025-02-05 16:17:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099949267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:17:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248754795] [2025-02-05 16:17:54,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:54,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:54,649 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 16:17:54,650 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 16:17:54,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:17:54,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:17:54,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:54,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:54,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:17:54,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:55,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:17:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248754795] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:17:56,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:17:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 16:17:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361086528] [2025-02-05 16:17:56,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:17:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:17:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:56,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:17:56,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:17:56,053 INFO L87 Difference]: Start difference. First operand 7597 states and 9757 transitions. Second operand has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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 16:17:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:57,143 INFO L93 Difference]: Finished difference Result 28363 states and 36469 transitions. [2025-02-05 16:17:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 16:17:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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 103 [2025-02-05 16:17:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:57,169 INFO L225 Difference]: With dead ends: 28363 [2025-02-05 16:17:57,169 INFO L226 Difference]: Without dead ends: 21030 [2025-02-05 16:17:57,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 16:17:57,189 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1929 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:57,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 957 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:17:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21030 states. [2025-02-05 16:17:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21030 to 20934. [2025-02-05 16:17:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20934 states, 20933 states have (on average 1.2611665790856543) internal successors, (26400), 20933 states have internal predecessors, (26400), 0 states have call successors, (0), 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 16:17:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20934 states to 20934 states and 26400 transitions. [2025-02-05 16:17:57,873 INFO L78 Accepts]: Start accepts. Automaton has 20934 states and 26400 transitions. Word has length 103 [2025-02-05 16:17:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:57,873 INFO L471 AbstractCegarLoop]: Abstraction has 20934 states and 26400 transitions. [2025-02-05 16:17:57,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.192307692307692) internal successors, (291), 25 states have internal predecessors, (291), 0 states have call successors, (0), 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 16:17:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20934 states and 26400 transitions. [2025-02-05 16:17:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:17:57,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:57,875 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:17:57,881 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 16:17:58,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 16:17:58,077 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2008418226, now seen corresponding path program 1 times [2025-02-05 16:17:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:58,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859545670] [2025-02-05 16:17:58,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:58,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:17:58,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:17:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859545670] [2025-02-05 16:17:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859545670] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:17:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296715080] [2025-02-05 16:17:59,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:59,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:59,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:59,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:17:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:17:59,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:17:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:17:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:59,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:17:59,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:59,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:18:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296715080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:18:00,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:18:00,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-05 16:18:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746853405] [2025-02-05 16:18:00,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:18:00,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:18:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:00,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:18:00,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:18:00,376 INFO L87 Difference]: Start difference. First operand 20934 states and 26400 transitions. Second operand has 26 states, 26 states have (on average 10.192307692307692) internal successors, (265), 25 states have internal predecessors, (265), 0 states have call successors, (0), 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 16:18:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:01,601 INFO L93 Difference]: Finished difference Result 61185 states and 77482 transitions. [2025-02-05 16:18:01,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:18:01,602 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.192307692307692) internal successors, (265), 25 states have internal predecessors, (265), 0 states have call successors, (0), 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 104 [2025-02-05 16:18:01,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:01,649 INFO L225 Difference]: With dead ends: 61185 [2025-02-05 16:18:01,649 INFO L226 Difference]: Without dead ends: 42670 [2025-02-05 16:18:01,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 16:18:01,671 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 1232 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:01,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 672 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:18:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42670 states. [2025-02-05 16:18:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42670 to 42202. [2025-02-05 16:18:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42202 states, 42201 states have (on average 1.2496149380346437) internal successors, (52735), 42201 states have internal predecessors, (52735), 0 states have call successors, (0), 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 16:18:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42202 states to 42202 states and 52735 transitions. [2025-02-05 16:18:02,964 INFO L78 Accepts]: Start accepts. Automaton has 42202 states and 52735 transitions. Word has length 104 [2025-02-05 16:18:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:02,965 INFO L471 AbstractCegarLoop]: Abstraction has 42202 states and 52735 transitions. [2025-02-05 16:18:02,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.192307692307692) internal successors, (265), 25 states have internal predecessors, (265), 0 states have call successors, (0), 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 16:18:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42202 states and 52735 transitions. [2025-02-05 16:18:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:18:02,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:02,966 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:18:02,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:18:03,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:18:03,171 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:03,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1589451429, now seen corresponding path program 1 times [2025-02-05 16:18:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693587779] [2025-02-05 16:18:03,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:03,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:18:03,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:18:03,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:03,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:03,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693587779] [2025-02-05 16:18:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693587779] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:18:03,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065250288] [2025-02-05 16:18:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:03,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:18:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:18:03,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:18:03,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:18:03,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:18:03,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:18:03,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:03,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:03,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:18:03,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:18:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:03,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:18:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065250288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:18:04,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:18:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-02-05 16:18:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243372654] [2025-02-05 16:18:04,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:18:04,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:18:04,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:04,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:18:04,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:18:04,517 INFO L87 Difference]: Start difference. First operand 42202 states and 52735 transitions. Second operand has 25 states, 25 states have (on average 10.64) internal successors, (266), 24 states have internal predecessors, (266), 0 states have call successors, (0), 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 16:18:06,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:06,926 INFO L93 Difference]: Finished difference Result 129644 states and 162736 transitions. [2025-02-05 16:18:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 16:18:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.64) internal successors, (266), 24 states have internal predecessors, (266), 0 states have call successors, (0), 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 16:18:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:07,016 INFO L225 Difference]: With dead ends: 129644 [2025-02-05 16:18:07,016 INFO L226 Difference]: Without dead ends: 87992 [2025-02-05 16:18:07,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=611, Invalid=2469, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 16:18:07,062 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1543 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:07,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1365 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:18:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87992 states. [2025-02-05 16:18:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87992 to 85240. [2025-02-05 16:18:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85240 states, 85239 states have (on average 1.2336841117328923) internal successors, (105158), 85239 states have internal predecessors, (105158), 0 states have call successors, (0), 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 16:18:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85240 states to 85240 states and 105158 transitions. [2025-02-05 16:18:09,256 INFO L78 Accepts]: Start accepts. Automaton has 85240 states and 105158 transitions. Word has length 105 [2025-02-05 16:18:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:18:09,256 INFO L471 AbstractCegarLoop]: Abstraction has 85240 states and 105158 transitions. [2025-02-05 16:18:09,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.64) internal successors, (266), 24 states have internal predecessors, (266), 0 states have call successors, (0), 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 16:18:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 85240 states and 105158 transitions. [2025-02-05 16:18:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:18:09,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:18:09,259 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:18:09,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:18:09,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-05 16:18:09,460 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:18:09,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:18:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1308746661, now seen corresponding path program 1 times [2025-02-05 16:18:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:18:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516161431] [2025-02-05 16:18:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:09,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:18:09,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:18:09,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:18:09,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:09,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:18:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516161431] [2025-02-05 16:18:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516161431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:18:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248555086] [2025-02-05 16:18:09,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:18:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:18:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:18:09,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:18:09,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:18:09,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:18:09,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:18:09,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:18:09,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:18:09,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:18:09,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:18:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:10,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:18:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:18:10,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248555086] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:18:10,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:18:10,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 16:18:10,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603048800] [2025-02-05 16:18:10,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:18:10,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:18:10,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:18:10,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:18:10,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:18:10,851 INFO L87 Difference]: Start difference. First operand 85240 states and 105158 transitions. Second operand has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 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 16:18:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:18:14,560 INFO L93 Difference]: Finished difference Result 246521 states and 304295 transitions. [2025-02-05 16:18:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:18:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.681818181818182) internal successors, (235), 21 states have internal predecessors, (235), 0 states have call successors, (0), 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 106 [2025-02-05 16:18:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:18:14,765 INFO L225 Difference]: With dead ends: 246521 [2025-02-05 16:18:14,766 INFO L226 Difference]: Without dead ends: 166859 [2025-02-05 16:18:14,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:18:14,837 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 988 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:18:14,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 718 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:18:14,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166859 states.