./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label58.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 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:07:01,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:07:01,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:07:01,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:07:01,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:07:01,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:07:01,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:07:01,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:07:01,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:07:01,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:07:01,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:07:01,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:07:01,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:07:01,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:07:01,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:07:01,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:07:01,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:07:01,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:07:01,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:07:01,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:07:01,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:07:01,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 [2025-02-05 12:07:02,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:07:02,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:07:02,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:07:02,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:07:02,059 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:07:02,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2025-02-05 12:07:03,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a56df3a9a/d2e761dc70a14efb972a029f5dd7c3a1/FLAGeb2ae3012 [2025-02-05 12:07:03,749 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:07:03,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2025-02-05 12:07:03,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a56df3a9a/d2e761dc70a14efb972a029f5dd7c3a1/FLAGeb2ae3012 [2025-02-05 12:07:03,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a56df3a9a/d2e761dc70a14efb972a029f5dd7c3a1 [2025-02-05 12:07:03,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:07:03,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:07:03,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:07:03,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:07:03,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:07:03,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:07:03" (1/1) ... [2025-02-05 12:07:03,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:03, skipping insertion in model container [2025-02-05 12:07:03,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:07:03" (1/1) ... [2025-02-05 12:07:04,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:07:04,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2025-02-05 12:07:04,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:07:04,593 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:07:04,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2025-02-05 12:07:04,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:07:04,822 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:07:04,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04 WrapperNode [2025-02-05 12:07:04,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:07:04,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:07:04,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:07:04,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:07:04,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:04,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,128 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:07:05,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:07:05,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:07:05,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:07:05,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:07:05,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,439 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 12:07:05,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:07:05,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:07:05,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:07:05,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:07:05,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (1/1) ... [2025-02-05 12:07:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:07:05,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:05,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:07:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:07:05,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:07:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:07:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:07:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:07:05,833 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:07:05,835 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:07:08,455 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:07:08,621 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:07:08,621 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:07:08,653 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:07:08,657 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:07:08,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:07:08 BoogieIcfgContainer [2025-02-05 12:07:08,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:07:08,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:07:08,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:07:08,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:07:08,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:07:03" (1/3) ... [2025-02-05 12:07:08,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e325504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:07:08, skipping insertion in model container [2025-02-05 12:07:08,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:07:04" (2/3) ... [2025-02-05 12:07:08,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e325504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:07:08, skipping insertion in model container [2025-02-05 12:07:08,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:07:08" (3/3) ... [2025-02-05 12:07:08,673 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2025-02-05 12:07:08,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:07:08,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label58.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:07:08,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:07:08,784 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;@35c5c254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:07:08,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:07:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 12:07:08,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:08,801 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] [2025-02-05 12:07:08,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:08,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1280947699, now seen corresponding path program 1 times [2025-02-05 12:07:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494560070] [2025-02-05 12:07:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 12:07:08,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 12:07:08,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:08,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:09,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:09,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494560070] [2025-02-05 12:07:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494560070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:09,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:09,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:07:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352975714] [2025-02-05 12:07:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:09,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:09,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:09,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:09,203 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:12,415 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-02-05 12:07:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-02-05 12:07:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:12,427 INFO L225 Difference]: With dead ends: 1667 [2025-02-05 12:07:12,427 INFO L226 Difference]: Without dead ends: 998 [2025-02-05 12:07:12,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:12,433 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:12,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 12:07:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-05 12:07:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-02-05 12:07:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-02-05 12:07:12,501 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 45 [2025-02-05 12:07:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:12,502 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-02-05 12:07:12,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-02-05 12:07:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 12:07:12,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:12,505 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:12,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:07:12,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:12,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:12,506 INFO L85 PathProgramCache]: Analyzing trace with hash 209969005, now seen corresponding path program 1 times [2025-02-05 12:07:12,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:12,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62173382] [2025-02-05 12:07:12,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:12,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 12:07:12,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 12:07:12,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:12,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62173382] [2025-02-05 12:07:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62173382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:12,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:07:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850774921] [2025-02-05 12:07:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:12,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:12,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:12,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:12,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:12,805 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:14,755 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-02-05 12:07:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-02-05 12:07:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:14,768 INFO L225 Difference]: With dead ends: 2824 [2025-02-05 12:07:14,768 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:07:14,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:14,778 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:14,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:07:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:07:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-02-05 12:07:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-02-05 12:07:14,858 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 110 [2025-02-05 12:07:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:14,858 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-02-05 12:07:14,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-02-05 12:07:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 12:07:14,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:14,865 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:14,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:07:14,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 303281924, now seen corresponding path program 1 times [2025-02-05 12:07:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684792884] [2025-02-05 12:07:14,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:14,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 12:07:14,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 12:07:14,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:15,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684792884] [2025-02-05 12:07:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684792884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:15,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908109682] [2025-02-05 12:07:15,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:15,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:15,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:15,164 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:17,442 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-02-05 12:07:17,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2025-02-05 12:07:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:17,453 INFO L225 Difference]: With dead ends: 4546 [2025-02-05 12:07:17,454 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 12:07:17,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:17,458 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:17,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 12:07:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 12:07:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-02-05 12:07:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-02-05 12:07:17,519 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 193 [2025-02-05 12:07:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:17,521 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-02-05 12:07:17,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-02-05 12:07:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 12:07:17,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:17,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:07:17,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1095746899, now seen corresponding path program 1 times [2025-02-05 12:07:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759262361] [2025-02-05 12:07:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:17,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 12:07:17,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 12:07:17,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:17,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:07:17,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:17,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759262361] [2025-02-05 12:07:17,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759262361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:17,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:17,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705867188] [2025-02-05 12:07:17,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:17,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:17,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:17,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:17,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:17,828 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:20,080 INFO L93 Difference]: Finished difference Result 6725 states and 9406 transitions. [2025-02-05 12:07:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-05 12:07:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:20,091 INFO L225 Difference]: With dead ends: 6725 [2025-02-05 12:07:20,092 INFO L226 Difference]: Without dead ends: 4023 [2025-02-05 12:07:20,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:20,095 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 508 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:20,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 240 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:07:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4023 states. [2025-02-05 12:07:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4023 to 4007. [2025-02-05 12:07:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 4006 states have (on average 1.3946580129805293) internal successors, (5587), 4006 states have internal predecessors, (5587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5587 transitions. [2025-02-05 12:07:20,152 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5587 transitions. Word has length 199 [2025-02-05 12:07:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:20,153 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 5587 transitions. [2025-02-05 12:07:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5587 transitions. [2025-02-05 12:07:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-05 12:07:20,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:20,155 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:07:20,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:20,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 413868107, now seen corresponding path program 1 times [2025-02-05 12:07:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005018239] [2025-02-05 12:07:20,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:20,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:20,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 12:07:20,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 12:07:20,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:20,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:20,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005018239] [2025-02-05 12:07:20,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005018239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850046295] [2025-02-05 12:07:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:20,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:07:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 12:07:20,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-05 12:07:20,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-05 12:07:20,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:20,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:20,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:07:20,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:20,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:21,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850046295] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:21,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:07:21,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-02-05 12:07:21,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803360944] [2025-02-05 12:07:21,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:21,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:07:21,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:21,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:07:21,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:07:21,288 INFO L87 Difference]: Start difference. First operand 4007 states and 5587 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 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 12:07:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:24,948 INFO L93 Difference]: Finished difference Result 13173 states and 18448 transitions. [2025-02-05 12:07:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:07:24,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 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 265 [2025-02-05 12:07:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:24,970 INFO L225 Difference]: With dead ends: 13173 [2025-02-05 12:07:24,971 INFO L226 Difference]: Without dead ends: 7887 [2025-02-05 12:07:24,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:07:24,977 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 836 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:24,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 156 Invalid, 3909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 12:07:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7887 states. [2025-02-05 12:07:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7887 to 7849. [2025-02-05 12:07:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7849 states, 7848 states have (on average 1.2860601427115188) internal successors, (10093), 7848 states have internal predecessors, (10093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7849 states to 7849 states and 10093 transitions. [2025-02-05 12:07:25,145 INFO L78 Accepts]: Start accepts. Automaton has 7849 states and 10093 transitions. Word has length 265 [2025-02-05 12:07:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:25,149 INFO L471 AbstractCegarLoop]: Abstraction has 7849 states and 10093 transitions. [2025-02-05 12:07:25,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 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 12:07:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7849 states and 10093 transitions. [2025-02-05 12:07:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-05 12:07:25,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:25,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:25,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 12:07:25,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:25,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -290296475, now seen corresponding path program 1 times [2025-02-05 12:07:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480497566] [2025-02-05 12:07:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:25,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-02-05 12:07:25,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-02-05 12:07:25,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:25,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:07:25,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:25,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480497566] [2025-02-05 12:07:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480497566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:25,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312563858] [2025-02-05 12:07:25,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:25,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:25,576 INFO L87 Difference]: Start difference. First operand 7849 states and 10093 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:27,167 INFO L93 Difference]: Finished difference Result 21222 states and 27261 transitions. [2025-02-05 12:07:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 283 [2025-02-05 12:07:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:27,196 INFO L225 Difference]: With dead ends: 21222 [2025-02-05 12:07:27,196 INFO L226 Difference]: Without dead ends: 11648 [2025-02-05 12:07:27,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:27,207 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 482 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:27,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 731 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:07:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2025-02-05 12:07:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11646. [2025-02-05 12:07:27,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11646 states, 11645 states have (on average 1.2312580506655217) internal successors, (14338), 11645 states have internal predecessors, (14338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:27,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11646 states to 11646 states and 14338 transitions. [2025-02-05 12:07:27,365 INFO L78 Accepts]: Start accepts. Automaton has 11646 states and 14338 transitions. Word has length 283 [2025-02-05 12:07:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:27,367 INFO L471 AbstractCegarLoop]: Abstraction has 11646 states and 14338 transitions. [2025-02-05 12:07:27,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:27,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11646 states and 14338 transitions. [2025-02-05 12:07:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 12:07:27,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:27,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:07:27,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1773091198, now seen corresponding path program 1 times [2025-02-05 12:07:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143102575] [2025-02-05 12:07:27,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:27,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 12:07:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 12:07:27,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:07:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:27,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143102575] [2025-02-05 12:07:27,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143102575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:27,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:27,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:27,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707675915] [2025-02-05 12:07:27,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:27,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:27,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:27,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:27,657 INFO L87 Difference]: Start difference. First operand 11646 states and 14338 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:29,325 INFO L93 Difference]: Finished difference Result 27984 states and 34322 transitions. [2025-02-05 12:07:29,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:29,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 302 [2025-02-05 12:07:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:29,414 INFO L225 Difference]: With dead ends: 27984 [2025-02-05 12:07:29,415 INFO L226 Difference]: Without dead ends: 15915 [2025-02-05 12:07:29,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:29,443 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 411 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:29,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 849 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:07:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15915 states. [2025-02-05 12:07:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15915 to 15909. [2025-02-05 12:07:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15909 states, 15908 states have (on average 1.1890243902439024) internal successors, (18915), 15908 states have internal predecessors, (18915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15909 states to 15909 states and 18915 transitions. [2025-02-05 12:07:29,703 INFO L78 Accepts]: Start accepts. Automaton has 15909 states and 18915 transitions. Word has length 302 [2025-02-05 12:07:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:29,704 INFO L471 AbstractCegarLoop]: Abstraction has 15909 states and 18915 transitions. [2025-02-05 12:07:29,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 15909 states and 18915 transitions. [2025-02-05 12:07:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-02-05 12:07:29,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:29,712 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 12:07:29,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:07:29,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:29,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 408993381, now seen corresponding path program 1 times [2025-02-05 12:07:29,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:29,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343138303] [2025-02-05 12:07:29,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:29,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:29,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-02-05 12:07:29,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-02-05 12:07:29,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-02-05 12:07:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343138303] [2025-02-05 12:07:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343138303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:29,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:29,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886346005] [2025-02-05 12:07:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:29,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:29,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:29,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:29,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:29,914 INFO L87 Difference]: Start difference. First operand 15909 states and 18915 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:31,401 INFO L93 Difference]: Finished difference Result 38610 states and 45841 transitions. [2025-02-05 12:07:31,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 365 [2025-02-05 12:07:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:31,436 INFO L225 Difference]: With dead ends: 38610 [2025-02-05 12:07:31,437 INFO L226 Difference]: Without dead ends: 22702 [2025-02-05 12:07:31,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:31,449 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 449 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:31,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 366 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:07:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2025-02-05 12:07:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 20577. [2025-02-05 12:07:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20577 states, 20576 states have (on average 1.161110031104199) internal successors, (23891), 20576 states have internal predecessors, (23891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20577 states to 20577 states and 23891 transitions. [2025-02-05 12:07:31,632 INFO L78 Accepts]: Start accepts. Automaton has 20577 states and 23891 transitions. Word has length 365 [2025-02-05 12:07:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:31,633 INFO L471 AbstractCegarLoop]: Abstraction has 20577 states and 23891 transitions. [2025-02-05 12:07:31,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20577 states and 23891 transitions. [2025-02-05 12:07:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-05 12:07:31,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:31,640 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:07:31,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1339557060, now seen corresponding path program 1 times [2025-02-05 12:07:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311958112] [2025-02-05 12:07:31,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:31,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-05 12:07:31,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-05 12:07:31,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:31,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-05 12:07:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:31,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311958112] [2025-02-05 12:07:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311958112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:31,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654958013] [2025-02-05 12:07:31,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:31,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:31,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:31,913 INFO L87 Difference]: Start difference. First operand 20577 states and 23891 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 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 12:07:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:33,579 INFO L93 Difference]: Finished difference Result 50935 states and 59227 transitions. [2025-02-05 12:07:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 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) Word has length 403 [2025-02-05 12:07:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:33,621 INFO L225 Difference]: With dead ends: 50935 [2025-02-05 12:07:33,621 INFO L226 Difference]: Without dead ends: 28658 [2025-02-05 12:07:33,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:33,638 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 263 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:33,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 770 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:07:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28658 states. [2025-02-05 12:07:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28658 to 22692. [2025-02-05 12:07:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22692 states, 22691 states have (on average 1.14433035124058) internal successors, (25966), 22691 states have internal predecessors, (25966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22692 states to 22692 states and 25966 transitions. [2025-02-05 12:07:34,004 INFO L78 Accepts]: Start accepts. Automaton has 22692 states and 25966 transitions. Word has length 403 [2025-02-05 12:07:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:34,005 INFO L471 AbstractCegarLoop]: Abstraction has 22692 states and 25966 transitions. [2025-02-05 12:07:34,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 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 12:07:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22692 states and 25966 transitions. [2025-02-05 12:07:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-05 12:07:34,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:34,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:34,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:07:34,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:34,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:34,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1206187317, now seen corresponding path program 1 times [2025-02-05 12:07:34,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:34,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424992418] [2025-02-05 12:07:34,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:34,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:34,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-05 12:07:34,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-05 12:07:34,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:34,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-02-05 12:07:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424992418] [2025-02-05 12:07:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424992418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995666359] [2025-02-05 12:07:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:34,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:34,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:34,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:34,544 INFO L87 Difference]: Start difference. First operand 22692 states and 25966 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:36,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:36,502 INFO L93 Difference]: Finished difference Result 50519 states and 57756 transitions. [2025-02-05 12:07:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:36,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 408 [2025-02-05 12:07:36,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:36,535 INFO L225 Difference]: With dead ends: 50519 [2025-02-05 12:07:36,535 INFO L226 Difference]: Without dead ends: 27829 [2025-02-05 12:07:36,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:36,557 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 464 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:36,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 143 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:07:36,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27829 states. [2025-02-05 12:07:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27829 to 21840. [2025-02-05 12:07:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21840 states, 21839 states have (on average 1.1478547552543614) internal successors, (25068), 21839 states have internal predecessors, (25068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21840 states to 21840 states and 25068 transitions. [2025-02-05 12:07:36,898 INFO L78 Accepts]: Start accepts. Automaton has 21840 states and 25068 transitions. Word has length 408 [2025-02-05 12:07:36,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:36,899 INFO L471 AbstractCegarLoop]: Abstraction has 21840 states and 25068 transitions. [2025-02-05 12:07:36,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21840 states and 25068 transitions. [2025-02-05 12:07:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 12:07:36,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:36,906 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 12:07:36,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1272775370, now seen corresponding path program 1 times [2025-02-05 12:07:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781034916] [2025-02-05 12:07:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:36,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 12:07:36,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 12:07:36,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:36,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 12:07:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781034916] [2025-02-05 12:07:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781034916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:37,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:37,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343735523] [2025-02-05 12:07:37,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:37,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:37,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:37,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:37,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:37,107 INFO L87 Difference]: Start difference. First operand 21840 states and 25068 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:38,518 INFO L93 Difference]: Finished difference Result 50899 states and 58681 transitions. [2025-02-05 12:07:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:38,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 430 [2025-02-05 12:07:38,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:38,553 INFO L225 Difference]: With dead ends: 50899 [2025-02-05 12:07:38,553 INFO L226 Difference]: Without dead ends: 29061 [2025-02-05 12:07:38,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:38,567 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 303 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:38,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 764 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:07:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29061 states. [2025-02-05 12:07:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29061 to 28209. [2025-02-05 12:07:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28209 states, 28208 states have (on average 1.1263825865002837) internal successors, (31773), 28208 states have internal predecessors, (31773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28209 states to 28209 states and 31773 transitions. [2025-02-05 12:07:38,828 INFO L78 Accepts]: Start accepts. Automaton has 28209 states and 31773 transitions. Word has length 430 [2025-02-05 12:07:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:38,829 INFO L471 AbstractCegarLoop]: Abstraction has 28209 states and 31773 transitions. [2025-02-05 12:07:38,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 28209 states and 31773 transitions. [2025-02-05 12:07:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 12:07:38,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:38,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:38,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:07:38,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:38,841 INFO L85 PathProgramCache]: Analyzing trace with hash 239646358, now seen corresponding path program 1 times [2025-02-05 12:07:38,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695868145] [2025-02-05 12:07:38,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:38,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 12:07:38,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 12:07:38,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:38,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695868145] [2025-02-05 12:07:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695868145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822235072] [2025-02-05 12:07:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:39,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:39,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:39,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 12:07:39,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 12:07:39,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 12:07:39,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 12:07:39,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:39,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:39,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:07:39,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:40,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822235072] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:07:40,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:07:40,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079484418] [2025-02-05 12:07:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:07:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:40,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:07:40,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:07:40,529 INFO L87 Difference]: Start difference. First operand 28209 states and 31773 transitions. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:42,708 INFO L93 Difference]: Finished difference Result 70477 states and 78995 transitions. [2025-02-05 12:07:42,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:07:42,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 476 [2025-02-05 12:07:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:42,871 INFO L225 Difference]: With dead ends: 70477 [2025-02-05 12:07:42,871 INFO L226 Difference]: Without dead ends: 40992 [2025-02-05 12:07:42,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 953 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:07:42,891 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 566 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:42,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 149 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:07:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40992 states. [2025-02-05 12:07:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40992 to 38864. [2025-02-05 12:07:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38864 states, 38863 states have (on average 1.1195738877595656) internal successors, (43510), 38863 states have internal predecessors, (43510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38864 states to 38864 states and 43510 transitions. [2025-02-05 12:07:43,260 INFO L78 Accepts]: Start accepts. Automaton has 38864 states and 43510 transitions. Word has length 476 [2025-02-05 12:07:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:43,261 INFO L471 AbstractCegarLoop]: Abstraction has 38864 states and 43510 transitions. [2025-02-05 12:07:43,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 38864 states and 43510 transitions. [2025-02-05 12:07:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-02-05 12:07:43,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:43,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:43,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 12:07:43,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:43,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:43,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1819849320, now seen corresponding path program 1 times [2025-02-05 12:07:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304538517] [2025-02-05 12:07:43,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:43,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 12:07:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 12:07:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304538517] [2025-02-05 12:07:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304538517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:07:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122715350] [2025-02-05 12:07:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:44,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:07:44,331 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 12:07:44,336 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 12:07:44,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-02-05 12:07:44,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-02-05 12:07:44,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:44,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:44,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:07:44,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:07:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:45,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:07:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 316 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:07:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122715350] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:07:45,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:07:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 12:07:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350716026] [2025-02-05 12:07:45,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:07:45,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 12:07:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:45,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 12:07:45,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:07:45,870 INFO L87 Difference]: Start difference. First operand 38864 states and 43510 transitions. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:51,509 INFO L93 Difference]: Finished difference Result 104132 states and 115619 transitions. [2025-02-05 12:07:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 12:07:51,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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 519 [2025-02-05 12:07:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:51,575 INFO L225 Difference]: With dead ends: 104132 [2025-02-05 12:07:51,575 INFO L226 Difference]: Without dead ends: 63570 [2025-02-05 12:07:51,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 1033 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-02-05 12:07:51,604 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 3063 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 7489 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 8487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 7489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:51,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3063 Valid, 410 Invalid, 8487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 7489 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 12:07:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63570 states. [2025-02-05 12:07:52,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63570 to 43131. [2025-02-05 12:07:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43131 states, 43130 states have (on average 1.1098539299791328) internal successors, (47868), 43130 states have internal predecessors, (47868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43131 states to 43131 states and 47868 transitions. [2025-02-05 12:07:52,240 INFO L78 Accepts]: Start accepts. Automaton has 43131 states and 47868 transitions. Word has length 519 [2025-02-05 12:07:52,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:52,241 INFO L471 AbstractCegarLoop]: Abstraction has 43131 states and 47868 transitions. [2025-02-05 12:07:52,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 43131 states and 47868 transitions. [2025-02-05 12:07:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-02-05 12:07:52,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:52,251 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:52,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 12:07:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:07:52,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1118563241, now seen corresponding path program 1 times [2025-02-05 12:07:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349977288] [2025-02-05 12:07:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:52,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-02-05 12:07:52,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-02-05 12:07:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 12:07:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349977288] [2025-02-05 12:07:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349977288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:52,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:52,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:52,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33561960] [2025-02-05 12:07:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:52,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:52,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:52,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:52,603 INFO L87 Difference]: Start difference. First operand 43131 states and 47868 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:54,480 INFO L93 Difference]: Finished difference Result 97743 states and 108725 transitions. [2025-02-05 12:07:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2025-02-05 12:07:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:54,542 INFO L225 Difference]: With dead ends: 97743 [2025-02-05 12:07:54,543 INFO L226 Difference]: Without dead ends: 50779 [2025-02-05 12:07:54,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:54,561 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:54,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 715 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:07:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50779 states. [2025-02-05 12:07:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50779 to 50773. [2025-02-05 12:07:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50773 states, 50772 states have (on average 1.0961159694319704) internal successors, (55652), 50772 states have internal predecessors, (55652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50773 states to 50773 states and 55652 transitions. [2025-02-05 12:07:55,178 INFO L78 Accepts]: Start accepts. Automaton has 50773 states and 55652 transitions. Word has length 524 [2025-02-05 12:07:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:55,179 INFO L471 AbstractCegarLoop]: Abstraction has 50773 states and 55652 transitions. [2025-02-05 12:07:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 50773 states and 55652 transitions. [2025-02-05 12:07:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2025-02-05 12:07:55,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:55,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:55,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:07:55,196 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:55,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:55,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1002065067, now seen corresponding path program 1 times [2025-02-05 12:07:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:55,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362991395] [2025-02-05 12:07:55,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:55,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes. [2025-02-05 12:07:55,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements. [2025-02-05 12:07:55,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:55,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:07:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362991395] [2025-02-05 12:07:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362991395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:07:55,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568622766] [2025-02-05 12:07:55,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:55,569 INFO L87 Difference]: Start difference. First operand 50773 states and 55652 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:56,456 INFO L93 Difference]: Finished difference Result 99409 states and 108859 transitions. [2025-02-05 12:07:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:56,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 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 635 [2025-02-05 12:07:56,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:56,506 INFO L225 Difference]: With dead ends: 99409 [2025-02-05 12:07:56,506 INFO L226 Difference]: Without dead ends: 49061 [2025-02-05 12:07:56,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:56,539 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 397 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:56,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 94 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 12:07:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49061 states. [2025-02-05 12:07:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49061 to 49056. [2025-02-05 12:07:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49056 states, 49055 states have (on average 1.0929568851289369) internal successors, (53615), 49055 states have internal predecessors, (53615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49056 states to 49056 states and 53615 transitions. [2025-02-05 12:07:57,245 INFO L78 Accepts]: Start accepts. Automaton has 49056 states and 53615 transitions. Word has length 635 [2025-02-05 12:07:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:07:57,246 INFO L471 AbstractCegarLoop]: Abstraction has 49056 states and 53615 transitions. [2025-02-05 12:07:57,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 49056 states and 53615 transitions. [2025-02-05 12:07:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2025-02-05 12:07:57,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:07:57,270 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:07:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 12:07:57,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:07:57,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:07:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1524719848, now seen corresponding path program 1 times [2025-02-05 12:07:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:07:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994971912] [2025-02-05 12:07:57,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:07:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:07:57,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 661 statements into 1 equivalence classes. [2025-02-05 12:07:57,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 661 of 661 statements. [2025-02-05 12:07:57,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:07:57,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:07:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-05 12:07:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:07:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994971912] [2025-02-05 12:07:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994971912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:07:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:07:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:07:57,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120216066] [2025-02-05 12:07:57,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:07:57,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:07:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:07:57,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:07:57,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:57,646 INFO L87 Difference]: Start difference. First operand 49056 states and 53615 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:07:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:07:59,553 INFO L93 Difference]: Finished difference Result 105758 states and 115876 transitions. [2025-02-05 12:07:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:07:59,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 661 [2025-02-05 12:07:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:07:59,621 INFO L225 Difference]: With dead ends: 105758 [2025-02-05 12:07:59,621 INFO L226 Difference]: Without dead ends: 57129 [2025-02-05 12:07:59,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:07:59,639 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 439 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:07:59,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 343 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:07:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57129 states. [2025-02-05 12:08:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57129 to 53300. [2025-02-05 12:08:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53300 states, 53299 states have (on average 1.0861179384228596) internal successors, (57889), 53299 states have internal predecessors, (57889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53300 states to 53300 states and 57889 transitions. [2025-02-05 12:08:00,255 INFO L78 Accepts]: Start accepts. Automaton has 53300 states and 57889 transitions. Word has length 661 [2025-02-05 12:08:00,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:00,256 INFO L471 AbstractCegarLoop]: Abstraction has 53300 states and 57889 transitions. [2025-02-05 12:08:00,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 53300 states and 57889 transitions. [2025-02-05 12:08:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-02-05 12:08:00,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:00,274 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:08:00,274 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:00,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 301637685, now seen corresponding path program 1 times [2025-02-05 12:08:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033446621] [2025-02-05 12:08:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:00,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-02-05 12:08:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-02-05 12:08:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 12:08:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:01,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033446621] [2025-02-05 12:08:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033446621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:08:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507282801] [2025-02-05 12:08:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:01,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:08:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:01,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:08:01,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:01,711 INFO L87 Difference]: Start difference. First operand 53300 states and 57889 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:03,269 INFO L93 Difference]: Finished difference Result 109159 states and 118623 transitions. [2025-02-05 12:08:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:08:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 687 [2025-02-05 12:08:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:03,334 INFO L225 Difference]: With dead ends: 109159 [2025-02-05 12:08:03,334 INFO L226 Difference]: Without dead ends: 56286 [2025-02-05 12:08:03,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:03,361 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 366 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:03,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 766 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:08:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56286 states. [2025-02-05 12:08:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56286 to 56279. [2025-02-05 12:08:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56279 states, 56278 states have (on average 1.0838693628060698) internal successors, (60998), 56278 states have internal predecessors, (60998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56279 states to 56279 states and 60998 transitions. [2025-02-05 12:08:04,072 INFO L78 Accepts]: Start accepts. Automaton has 56279 states and 60998 transitions. Word has length 687 [2025-02-05 12:08:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:04,073 INFO L471 AbstractCegarLoop]: Abstraction has 56279 states and 60998 transitions. [2025-02-05 12:08:04,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:04,073 INFO L276 IsEmpty]: Start isEmpty. Operand 56279 states and 60998 transitions. [2025-02-05 12:08:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-02-05 12:08:04,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:04,090 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 12:08:04,090 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:04,091 INFO L85 PathProgramCache]: Analyzing trace with hash 152979532, now seen corresponding path program 1 times [2025-02-05 12:08:04,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:04,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313633082] [2025-02-05 12:08:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:04,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-02-05 12:08:04,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-02-05 12:08:04,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:04,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-05 12:08:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313633082] [2025-02-05 12:08:04,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313633082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:04,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:04,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:08:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122899765] [2025-02-05 12:08:04,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:04,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:08:04,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:04,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:08:04,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:04,523 INFO L87 Difference]: Start difference. First operand 56279 states and 60998 transitions. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:06,082 INFO L93 Difference]: Finished difference Result 121081 states and 131457 transitions. [2025-02-05 12:08:06,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:08:06,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 688 [2025-02-05 12:08:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:06,178 INFO L225 Difference]: With dead ends: 121081 [2025-02-05 12:08:06,179 INFO L226 Difference]: Without dead ends: 63527 [2025-02-05 12:08:06,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:06,221 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 415 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:06,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 634 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:08:06,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63527 states. [2025-02-05 12:08:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63527 to 61818. [2025-02-05 12:08:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61818 states, 61817 states have (on average 1.0852192762508694) internal successors, (67085), 61817 states have internal predecessors, (67085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61818 states to 61818 states and 67085 transitions. [2025-02-05 12:08:07,208 INFO L78 Accepts]: Start accepts. Automaton has 61818 states and 67085 transitions. Word has length 688 [2025-02-05 12:08:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 61818 states and 67085 transitions. [2025-02-05 12:08:07,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 61818 states and 67085 transitions. [2025-02-05 12:08:07,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2025-02-05 12:08:07,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:07,476 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 12:08:07,476 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:07,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 657644340, now seen corresponding path program 1 times [2025-02-05 12:08:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:07,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60324260] [2025-02-05 12:08:07,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:07,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 698 statements into 1 equivalence classes. [2025-02-05 12:08:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 698 of 698 statements. [2025-02-05 12:08:07,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:07,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 12:08:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60324260] [2025-02-05 12:08:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60324260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:08:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776834433] [2025-02-05 12:08:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:08:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:08,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:08:08,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:08:08,108 INFO L87 Difference]: Start difference. First operand 61818 states and 67085 transitions. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:10,306 INFO L93 Difference]: Finished difference Result 142389 states and 154759 transitions. [2025-02-05 12:08:10,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:08:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 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 698 [2025-02-05 12:08:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:10,567 INFO L225 Difference]: With dead ends: 142389 [2025-02-05 12:08:10,567 INFO L226 Difference]: Without dead ends: 80998 [2025-02-05 12:08:10,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:08:10,602 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 816 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:10,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 167 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:08:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80998 states. [2025-02-05 12:08:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80998 to 77161. [2025-02-05 12:08:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77161 states, 77160 states have (on average 1.088867288750648) internal successors, (84017), 77160 states have internal predecessors, (84017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77161 states to 77161 states and 84017 transitions. [2025-02-05 12:08:11,765 INFO L78 Accepts]: Start accepts. Automaton has 77161 states and 84017 transitions. Word has length 698 [2025-02-05 12:08:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:11,766 INFO L471 AbstractCegarLoop]: Abstraction has 77161 states and 84017 transitions. [2025-02-05 12:08:11,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 77161 states and 84017 transitions. [2025-02-05 12:08:11,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-02-05 12:08:11,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:11,793 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:11,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 12:08:11,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1945189319, now seen corresponding path program 1 times [2025-02-05 12:08:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:11,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199775293] [2025-02-05 12:08:11,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:11,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:11,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 12:08:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 12:08:11,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:11,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-05 12:08:12,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199775293] [2025-02-05 12:08:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199775293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:12,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:12,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:08:12,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520069976] [2025-02-05 12:08:12,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:08:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:12,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:08:12,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:12,386 INFO L87 Difference]: Start difference. First operand 77161 states and 84017 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:14,131 INFO L93 Difference]: Finished difference Result 167090 states and 182084 transitions. [2025-02-05 12:08:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:08:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 711 [2025-02-05 12:08:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:14,245 INFO L225 Difference]: With dead ends: 167090 [2025-02-05 12:08:14,245 INFO L226 Difference]: Without dead ends: 90356 [2025-02-05 12:08:14,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:14,290 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 378 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:14,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 274 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:08:14,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90356 states. [2025-02-05 12:08:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90356 to 88226. [2025-02-05 12:08:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88226 states, 88225 states have (on average 1.0848625672995182) internal successors, (95712), 88225 states have internal predecessors, (95712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88226 states to 88226 states and 95712 transitions. [2025-02-05 12:08:15,575 INFO L78 Accepts]: Start accepts. Automaton has 88226 states and 95712 transitions. Word has length 711 [2025-02-05 12:08:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 88226 states and 95712 transitions. [2025-02-05 12:08:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 88226 states and 95712 transitions. [2025-02-05 12:08:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2025-02-05 12:08:15,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:15,600 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:15,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 12:08:15,601 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1873778174, now seen corresponding path program 1 times [2025-02-05 12:08:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818815911] [2025-02-05 12:08:15,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:15,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 718 statements into 1 equivalence classes. [2025-02-05 12:08:15,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 718 of 718 statements. [2025-02-05 12:08:15,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 12:08:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:16,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818815911] [2025-02-05 12:08:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818815911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:08:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633267119] [2025-02-05 12:08:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:08:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:16,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:08:16,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:16,566 INFO L87 Difference]: Start difference. First operand 88226 states and 95712 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:18,120 INFO L93 Difference]: Finished difference Result 178154 states and 193208 transitions. [2025-02-05 12:08:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:08:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 718 [2025-02-05 12:08:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:18,216 INFO L225 Difference]: With dead ends: 178154 [2025-02-05 12:08:18,216 INFO L226 Difference]: Without dead ends: 90355 [2025-02-05 12:08:18,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:18,267 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 114 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:18,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 765 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 12:08:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90355 states. [2025-02-05 12:08:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90355 to 89927. [2025-02-05 12:08:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89927 states, 89926 states have (on average 1.0827458132242065) internal successors, (97367), 89926 states have internal predecessors, (97367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89927 states to 89927 states and 97367 transitions. [2025-02-05 12:08:19,682 INFO L78 Accepts]: Start accepts. Automaton has 89927 states and 97367 transitions. Word has length 718 [2025-02-05 12:08:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 89927 states and 97367 transitions. [2025-02-05 12:08:19,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 89927 states and 97367 transitions. [2025-02-05 12:08:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-02-05 12:08:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:19,729 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:19,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 12:08:19,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -952743050, now seen corresponding path program 1 times [2025-02-05 12:08:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640543044] [2025-02-05 12:08:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:19,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-02-05 12:08:19,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-02-05 12:08:19,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:19,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:08:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-02-05 12:08:20,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:08:20,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640543044] [2025-02-05 12:08:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640543044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:08:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:08:20,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:08:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654972179] [2025-02-05 12:08:20,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:08:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:08:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:08:20,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:08:20,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:20,482 INFO L87 Difference]: Start difference. First operand 89927 states and 97367 transitions. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:08:22,501 INFO L93 Difference]: Finished difference Result 189662 states and 205401 transitions. [2025-02-05 12:08:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:08:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 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 746 [2025-02-05 12:08:22,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:08:22,629 INFO L225 Difference]: With dead ends: 189662 [2025-02-05 12:08:22,629 INFO L226 Difference]: Without dead ends: 100162 [2025-02-05 12:08:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:08:22,658 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 415 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:08:22,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 220 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:08:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100162 states. [2025-02-05 12:08:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100162 to 92907. [2025-02-05 12:08:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92907 states, 92906 states have (on average 1.0787785503627323) internal successors, (100225), 92906 states have internal predecessors, (100225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92907 states to 92907 states and 100225 transitions. [2025-02-05 12:08:23,651 INFO L78 Accepts]: Start accepts. Automaton has 92907 states and 100225 transitions. Word has length 746 [2025-02-05 12:08:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:08:23,651 INFO L471 AbstractCegarLoop]: Abstraction has 92907 states and 100225 transitions. [2025-02-05 12:08:23,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:08:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 92907 states and 100225 transitions. [2025-02-05 12:08:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-02-05 12:08:23,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:08:23,672 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:08:23,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 12:08:23,672 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:08:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:08:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1196060287, now seen corresponding path program 1 times [2025-02-05 12:08:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:08:23,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467222899] [2025-02-05 12:08:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:08:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:08:23,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-02-05 12:08:23,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-02-05 12:08:23,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:08:23,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat