./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label37.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/Problem12_label37.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 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:38:22,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:38:22,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:38:22,781 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:38:22,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:38:22,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:38:22,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:38:22,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:38:22,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:38:22,811 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:38:22,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:38:22,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:38:22,812 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:38:22,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:38:22,812 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:38:22,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:38:22,813 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:38:22,813 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:22,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:38:22,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:38:22,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:38:22,815 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 -> 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 [2025-02-05 11:38:23,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:38:23,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:38:23,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:38:23,130 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:38:23,130 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:38:23,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-02-05 11:38:24,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cecf636/a6e804862c574d899768113cd5277324/FLAGe78075e40 [2025-02-05 11:38:24,791 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:38:24,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-02-05 11:38:24,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cecf636/a6e804862c574d899768113cd5277324/FLAGe78075e40 [2025-02-05 11:38:24,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/44cecf636/a6e804862c574d899768113cd5277324 [2025-02-05 11:38:24,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:38:24,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:38:24,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:24,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:38:24,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:38:24,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:24" (1/1) ... [2025-02-05 11:38:24,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7feedaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:24, skipping insertion in model container [2025-02-05 11:38:24,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:38:24" (1/1) ... [2025-02-05 11:38:24,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:38:25,151 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/Problem12_label37.c[2005,2018] [2025-02-05 11:38:25,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:25,737 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:38:25,751 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/Problem12_label37.c[2005,2018] [2025-02-05 11:38:26,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:38:26,055 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:38:26,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26 WrapperNode [2025-02-05 11:38:26,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:38:26,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:26,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:38:26,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:38:26,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,372 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-02-05 11:38:26,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:38:26,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:38:26,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:38:26,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:38:26,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,545 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 11:38:26,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:38:26,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:38:26,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:38:26,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:38:26,747 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (1/1) ... [2025-02-05 11:38:26,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:38:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:26,772 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 11:38:26,776 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 11:38:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:38:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:38:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:38:26,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:38:26,856 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:38:26,857 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:38:30,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:38:30,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-02-05 11:38:30,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:38:30,288 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-02-05 11:38:30,288 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:38:30,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:38:30,319 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:38:30,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:30 BoogieIcfgContainer [2025-02-05 11:38:30,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:38:30,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:38:30,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:38:30,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:38:30,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:38:24" (1/3) ... [2025-02-05 11:38:30,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f1555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:30, skipping insertion in model container [2025-02-05 11:38:30,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:38:26" (2/3) ... [2025-02-05 11:38:30,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2f1555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:38:30, skipping insertion in model container [2025-02-05 11:38:30,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:38:30" (3/3) ... [2025-02-05 11:38:30,327 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label37.c [2025-02-05 11:38:30,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:38:30,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label37.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:38:30,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:38:30,410 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;@1adeeca7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:38:30,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:38:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 11:38:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 11:38:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:30,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:30,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:30,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -424593114, now seen corresponding path program 1 times [2025-02-05 11:38:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:30,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968673883] [2025-02-05 11:38:30,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:30,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 11:38:30,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 11:38:30,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:30,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:30,597 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 11:38:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:30,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968673883] [2025-02-05 11:38:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968673883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:30,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:30,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133299458] [2025-02-05 11:38:30,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:30,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:30,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:30,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:30,622 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 11:38:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:33,585 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-02-05 11:38:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:33,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-05 11:38:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:33,608 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 11:38:33,608 INFO L226 Difference]: Without dead ends: 1506 [2025-02-05 11:38:33,617 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 11:38:33,622 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 821 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:33,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:38:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-02-05 11:38:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-02-05 11:38:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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 11:38:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2025-02-05 11:38:33,705 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 13 [2025-02-05 11:38:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:33,705 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2025-02-05 11:38:33,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 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 11:38:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2025-02-05 11:38:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 11:38:33,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:33,707 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:33,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:38:33,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1060750435, now seen corresponding path program 1 times [2025-02-05 11:38:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478255615] [2025-02-05 11:38:33,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 11:38:33,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 11:38:33,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:33,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:34,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:34,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478255615] [2025-02-05 11:38:34,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478255615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:38:34,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682591309] [2025-02-05 11:38:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:34,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:34,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:34,102 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 11:38:34,107 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 11:38:34,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 11:38:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 11:38:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:34,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:38:34,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:38:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:34,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:38:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682591309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:38:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:38:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252312064] [2025-02-05 11:38:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:34,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:34,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:34,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:34,214 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:37,137 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2025-02-05 11:38:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-05 11:38:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:37,146 INFO L225 Difference]: With dead ends: 4512 [2025-02-05 11:38:37,146 INFO L226 Difference]: Without dead ends: 3008 [2025-02-05 11:38:37,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:37,148 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 766 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:37,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:38:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-02-05 11:38:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-02-05 11:38:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 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 11:38:37,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2025-02-05 11:38:37,223 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 84 [2025-02-05 11:38:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2025-02-05 11:38:37,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2025-02-05 11:38:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 11:38:37,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:37,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:37,234 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 11:38:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:37,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:37,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1002384382, now seen corresponding path program 1 times [2025-02-05 11:38:37,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:37,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582801926] [2025-02-05 11:38:37,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:37,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 11:38:37,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 11:38:37,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:37,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:37,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582801926] [2025-02-05 11:38:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582801926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:37,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:37,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075273208] [2025-02-05 11:38:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:37,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:37,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:37,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:37,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:37,545 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 11:38:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:39,987 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2025-02-05 11:38:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-02-05 11:38:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:40,018 INFO L225 Difference]: With dead ends: 7516 [2025-02-05 11:38:40,019 INFO L226 Difference]: Without dead ends: 4510 [2025-02-05 11:38:40,027 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 11:38:40,028 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:40,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:38:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-02-05 11:38:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2025-02-05 11:38:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 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 11:38:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2025-02-05 11:38:40,096 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 87 [2025-02-05 11:38:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:40,097 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2025-02-05 11:38:40,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 11:38:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2025-02-05 11:38:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 11:38:40,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:40,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:40,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:38:40,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:40,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:40,099 INFO L85 PathProgramCache]: Analyzing trace with hash -265540442, now seen corresponding path program 1 times [2025-02-05 11:38:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604762641] [2025-02-05 11:38:40,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:40,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 11:38:40,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 11:38:40,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:40,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:40,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604762641] [2025-02-05 11:38:40,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604762641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:40,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:40,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:38:40,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766731684] [2025-02-05 11:38:40,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:40,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:40,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:40,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:40,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:40,193 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:42,625 INFO L93 Difference]: Finished difference Result 13526 states and 17921 transitions. [2025-02-05 11:38:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:42,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 11:38:42,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:42,667 INFO L225 Difference]: With dead ends: 13526 [2025-02-05 11:38:42,667 INFO L226 Difference]: Without dead ends: 9018 [2025-02-05 11:38:42,671 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 11:38:42,673 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:42,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 618 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:38:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9018 states. [2025-02-05 11:38:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 9016. [2025-02-05 11:38:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2167498613422074) internal successors, (10969), 9015 states have internal predecessors, (10969), 0 states have call successors, (0), 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 11:38:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 10969 transitions. [2025-02-05 11:38:42,781 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 10969 transitions. Word has length 98 [2025-02-05 11:38:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:42,782 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 10969 transitions. [2025-02-05 11:38:42,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:38:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 10969 transitions. [2025-02-05 11:38:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 11:38:42,787 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:42,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:38:42,788 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -468701524, now seen corresponding path program 1 times [2025-02-05 11:38:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053033068] [2025-02-05 11:38:42,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:42,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 11:38:42,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 11:38:42,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053033068] [2025-02-05 11:38:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053033068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195661034] [2025-02-05 11:38:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:38:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:38:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:43,046 INFO L87 Difference]: Start difference. First operand 9016 states and 10969 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 11:38:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:45,836 INFO L93 Difference]: Finished difference Result 22575 states and 26968 transitions. [2025-02-05 11:38:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:38:45,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-02-05 11:38:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:45,868 INFO L225 Difference]: With dead ends: 22575 [2025-02-05 11:38:45,869 INFO L226 Difference]: Without dead ends: 12022 [2025-02-05 11:38:45,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:38:45,879 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3801 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:45,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 706 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3801 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:38:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12022 states. [2025-02-05 11:38:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12022 to 12020. [2025-02-05 11:38:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.1626591230551626) internal successors, (13974), 12019 states have internal predecessors, (13974), 0 states have call successors, (0), 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 11:38:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 13974 transitions. [2025-02-05 11:38:46,071 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 13974 transitions. Word has length 152 [2025-02-05 11:38:46,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:46,072 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 13974 transitions. [2025-02-05 11:38:46,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 11:38:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 13974 transitions. [2025-02-05 11:38:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 11:38:46,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:46,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:38:46,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:38:46,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash -294493523, now seen corresponding path program 1 times [2025-02-05 11:38:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494576815] [2025-02-05 11:38:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:46,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 11:38:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 11:38:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:46,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494576815] [2025-02-05 11:38:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494576815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:46,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:46,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:38:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566245406] [2025-02-05 11:38:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:46,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:38:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:46,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:38:46,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:38:46,456 INFO L87 Difference]: Start difference. First operand 12020 states and 13974 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 11:38:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:50,409 INFO L93 Difference]: Finished difference Result 30046 states and 34543 transitions. [2025-02-05 11:38:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:38:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2025-02-05 11:38:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:50,434 INFO L225 Difference]: With dead ends: 30046 [2025-02-05 11:38:50,434 INFO L226 Difference]: Without dead ends: 18779 [2025-02-05 11:38:50,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:50,443 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 3431 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5203 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3431 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 5356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 5203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:50,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3431 Valid, 642 Invalid, 5356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 5203 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 11:38:50,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18779 states. [2025-02-05 11:38:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18779 to 18028. [2025-02-05 11:38:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18028 states, 18027 states have (on average 1.1236478615410217) internal successors, (20256), 18027 states have internal predecessors, (20256), 0 states have call successors, (0), 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 11:38:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18028 states to 18028 states and 20256 transitions. [2025-02-05 11:38:50,599 INFO L78 Accepts]: Start accepts. Automaton has 18028 states and 20256 transitions. Word has length 157 [2025-02-05 11:38:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:50,599 INFO L471 AbstractCegarLoop]: Abstraction has 18028 states and 20256 transitions. [2025-02-05 11:38:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 11:38:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18028 states and 20256 transitions. [2025-02-05 11:38:50,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-02-05 11:38:50,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:50,601 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:38:50,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:50,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash 46079898, now seen corresponding path program 1 times [2025-02-05 11:38:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:50,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195532749] [2025-02-05 11:38:50,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:50,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:50,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-02-05 11:38:50,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-02-05 11:38:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:38:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195532749] [2025-02-05 11:38:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195532749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556200113] [2025-02-05 11:38:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:50,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:50,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:50,734 INFO L87 Difference]: Start difference. First operand 18028 states and 20256 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 11:38:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:53,783 INFO L93 Difference]: Finished difference Result 51074 states and 57668 transitions. [2025-02-05 11:38:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:53,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2025-02-05 11:38:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:53,854 INFO L225 Difference]: With dead ends: 51074 [2025-02-05 11:38:53,854 INFO L226 Difference]: Without dead ends: 33048 [2025-02-05 11:38:53,888 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 11:38:53,890 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:53,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1344 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:38:53,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33048 states. [2025-02-05 11:38:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33048 to 30044. [2025-02-05 11:38:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1242552341643643) internal successors, (33776), 30043 states have internal predecessors, (33776), 0 states have call successors, (0), 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 11:38:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 33776 transitions. [2025-02-05 11:38:54,363 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 33776 transitions. Word has length 239 [2025-02-05 11:38:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:54,364 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 33776 transitions. [2025-02-05 11:38:54,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 11:38:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 33776 transitions. [2025-02-05 11:38:54,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-05 11:38:54,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:54,366 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:38:54,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:38:54,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:54,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2019774480, now seen corresponding path program 1 times [2025-02-05 11:38:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369644885] [2025-02-05 11:38:54,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:54,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:54,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-02-05 11:38:54,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-02-05 11:38:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:54,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:38:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:54,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369644885] [2025-02-05 11:38:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369644885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:54,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:38:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:38:54,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484947266] [2025-02-05 11:38:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:54,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:38:54,554 INFO L87 Difference]: Start difference. First operand 30044 states and 33776 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 11:38:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:38:56,864 INFO L93 Difference]: Finished difference Result 60086 states and 67550 transitions. [2025-02-05 11:38:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:38:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 243 [2025-02-05 11:38:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:38:56,940 INFO L225 Difference]: With dead ends: 60086 [2025-02-05 11:38:56,947 INFO L226 Difference]: Without dead ends: 30044 [2025-02-05 11:38:56,975 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 11:38:56,975 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 814 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:38:56,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 998 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:38:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30044 states. [2025-02-05 11:38:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30044 to 30044. [2025-02-05 11:38:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.097793163132843) internal successors, (32981), 30043 states have internal predecessors, (32981), 0 states have call successors, (0), 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 11:38:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 32981 transitions. [2025-02-05 11:38:57,215 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 32981 transitions. Word has length 243 [2025-02-05 11:38:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:38:57,215 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 32981 transitions. [2025-02-05 11:38:57,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 11:38:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 32981 transitions. [2025-02-05 11:38:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-02-05 11:38:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:38:57,223 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:38:57,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:38:57,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:38:57,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:38:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -733685267, now seen corresponding path program 1 times [2025-02-05 11:38:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:38:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114071654] [2025-02-05 11:38:57,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:57,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:38:57,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-05 11:38:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-05 11:38:57,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:57,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 73 proven. 160 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 11:38:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:38:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114071654] [2025-02-05 11:38:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114071654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:38:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727726726] [2025-02-05 11:38:57,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:38:57,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:38:57,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:38:57,656 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 11:38:57,660 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 11:38:57,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-02-05 11:38:57,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-02-05 11:38:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:38:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:38:57,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:38:57,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:38:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-02-05 11:38:57,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:38:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727726726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:38:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:38:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:38:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746990026] [2025-02-05 11:38:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:38:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:38:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:38:57,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:38:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:38:57,986 INFO L87 Difference]: Start difference. First operand 30044 states and 32981 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 11:39:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:00,339 INFO L93 Difference]: Finished difference Result 72853 states and 80761 transitions. [2025-02-05 11:39:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:00,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 319 [2025-02-05 11:39:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:00,385 INFO L225 Difference]: With dead ends: 72853 [2025-02-05 11:39:00,385 INFO L226 Difference]: Without dead ends: 37554 [2025-02-05 11:39:00,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:00,412 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 903 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:00,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 309 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:39:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2025-02-05 11:39:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 31546. [2025-02-05 11:39:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31546 states, 31545 states have (on average 1.0853384054525281) internal successors, (34237), 31545 states have internal predecessors, (34237), 0 states have call successors, (0), 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 11:39:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31546 states to 31546 states and 34237 transitions. [2025-02-05 11:39:00,778 INFO L78 Accepts]: Start accepts. Automaton has 31546 states and 34237 transitions. Word has length 319 [2025-02-05 11:39:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:00,779 INFO L471 AbstractCegarLoop]: Abstraction has 31546 states and 34237 transitions. [2025-02-05 11:39:00,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 11:39:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 31546 states and 34237 transitions. [2025-02-05 11:39:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-02-05 11:39:00,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:00,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:00,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:39:00,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:00,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:00,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1506989820, now seen corresponding path program 1 times [2025-02-05 11:39:00,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93634598] [2025-02-05 11:39:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:01,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-02-05 11:39:01,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-02-05 11:39:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:01,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-02-05 11:39:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93634598] [2025-02-05 11:39:01,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93634598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:01,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:01,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418432312] [2025-02-05 11:39:01,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:01,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:01,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:01,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:01,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:01,187 INFO L87 Difference]: Start difference. First operand 31546 states and 34237 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 11:39:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:03,362 INFO L93 Difference]: Finished difference Result 65343 states and 70750 transitions. [2025-02-05 11:39:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 381 [2025-02-05 11:39:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:03,394 INFO L225 Difference]: With dead ends: 65343 [2025-02-05 11:39:03,394 INFO L226 Difference]: Without dead ends: 33799 [2025-02-05 11:39:03,433 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 11:39:03,434 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 646 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:03,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 110 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 11:39:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33799 states. [2025-02-05 11:39:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33799 to 30795. [2025-02-05 11:39:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30795 states, 30794 states have (on average 1.0818990712476457) internal successors, (33316), 30794 states have internal predecessors, (33316), 0 states have call successors, (0), 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 11:39:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30795 states to 30795 states and 33316 transitions. [2025-02-05 11:39:03,883 INFO L78 Accepts]: Start accepts. Automaton has 30795 states and 33316 transitions. Word has length 381 [2025-02-05 11:39:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:03,884 INFO L471 AbstractCegarLoop]: Abstraction has 30795 states and 33316 transitions. [2025-02-05 11:39:03,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 11:39:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 30795 states and 33316 transitions. [2025-02-05 11:39:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-05 11:39:03,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:03,889 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:39:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:39:03,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:03,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1153197693, now seen corresponding path program 1 times [2025-02-05 11:39:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882289264] [2025-02-05 11:39:03,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:03,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 11:39:03,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 11:39:03,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:03,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 73 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 11:39:04,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882289264] [2025-02-05 11:39:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882289264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:04,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800008299] [2025-02-05 11:39:04,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:04,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:04,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:04,220 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 11:39:04,222 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 11:39:04,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-05 11:39:04,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-05 11:39:04,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:04,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:04,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:39:04,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-05 11:39:04,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800008299] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:04,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 11:39:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313424458] [2025-02-05 11:39:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:04,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:04,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:04,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:39:04,512 INFO L87 Difference]: Start difference. First operand 30795 states and 33316 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 11:39:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:06,965 INFO L93 Difference]: Finished difference Result 72853 states and 79559 transitions. [2025-02-05 11:39:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:06,966 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 392 [2025-02-05 11:39:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:07,002 INFO L225 Difference]: With dead ends: 72853 [2025-02-05 11:39:07,002 INFO L226 Difference]: Without dead ends: 42060 [2025-02-05 11:39:07,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:39:07,018 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 674 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:07,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 861 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [738 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42060 states. [2025-02-05 11:39:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42060 to 40558. [2025-02-05 11:39:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40558 states, 40557 states have (on average 1.0969499716448454) internal successors, (44489), 40557 states have internal predecessors, (44489), 0 states have call successors, (0), 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 11:39:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40558 states to 40558 states and 44489 transitions. [2025-02-05 11:39:07,338 INFO L78 Accepts]: Start accepts. Automaton has 40558 states and 44489 transitions. Word has length 392 [2025-02-05 11:39:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:07,339 INFO L471 AbstractCegarLoop]: Abstraction has 40558 states and 44489 transitions. [2025-02-05 11:39:07,339 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 11:39:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 40558 states and 44489 transitions. [2025-02-05 11:39:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-02-05 11:39:07,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:07,350 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:07,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 11:39:07,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:07,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:07,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1424436641, now seen corresponding path program 1 times [2025-02-05 11:39:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:07,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941425035] [2025-02-05 11:39:07,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:07,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:07,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-02-05 11:39:07,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-02-05 11:39:07,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:07,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-05 11:39:07,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:07,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941425035] [2025-02-05 11:39:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941425035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927846645] [2025-02-05 11:39:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:07,704 INFO L87 Difference]: Start difference. First operand 40558 states and 44489 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:10,150 INFO L93 Difference]: Finished difference Result 99138 states and 109520 transitions. [2025-02-05 11:39:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 570 [2025-02-05 11:39:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:10,225 INFO L225 Difference]: With dead ends: 99138 [2025-02-05 11:39:10,225 INFO L226 Difference]: Without dead ends: 58582 [2025-02-05 11:39:10,254 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 11:39:10,256 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 676 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:10,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 333 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:39:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58582 states. [2025-02-05 11:39:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58582 to 58582. [2025-02-05 11:39:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58582 states, 58581 states have (on average 1.0923336918113382) internal successors, (63990), 58581 states have internal predecessors, (63990), 0 states have call successors, (0), 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 11:39:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58582 states to 58582 states and 63990 transitions. [2025-02-05 11:39:10,813 INFO L78 Accepts]: Start accepts. Automaton has 58582 states and 63990 transitions. Word has length 570 [2025-02-05 11:39:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:10,813 INFO L471 AbstractCegarLoop]: Abstraction has 58582 states and 63990 transitions. [2025-02-05 11:39:10,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58582 states and 63990 transitions. [2025-02-05 11:39:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-02-05 11:39:10,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:10,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:10,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:39:10,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:10,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1915575363, now seen corresponding path program 1 times [2025-02-05 11:39:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:10,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501099069] [2025-02-05 11:39:10,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 11:39:10,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 11:39:10,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:10,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 116 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501099069] [2025-02-05 11:39:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501099069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470496831] [2025-02-05 11:39:11,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:11,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:11,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:11,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:39:11,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 11:39:11,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 11:39:11,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 11:39:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:11,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:11,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:39:11,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:12,357 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:39:12,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:39:12,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470496831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:12,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:39:12,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:39:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354676480] [2025-02-05 11:39:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:12,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:12,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:12,360 INFO L87 Difference]: Start difference. First operand 58582 states and 63990 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 11:39:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:14,511 INFO L93 Difference]: Finished difference Result 118664 states and 129592 transitions. [2025-02-05 11:39:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 595 [2025-02-05 11:39:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:14,634 INFO L225 Difference]: With dead ends: 118664 [2025-02-05 11:39:14,634 INFO L226 Difference]: Without dead ends: 60084 [2025-02-05 11:39:14,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:39:14,665 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 413 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:14,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1171 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:39:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60084 states. [2025-02-05 11:39:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60084 to 60084. [2025-02-05 11:39:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60084 states, 60083 states have (on average 1.0876454238303679) internal successors, (65349), 60083 states have internal predecessors, (65349), 0 states have call successors, (0), 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 11:39:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60084 states to 60084 states and 65349 transitions. [2025-02-05 11:39:15,082 INFO L78 Accepts]: Start accepts. Automaton has 60084 states and 65349 transitions. Word has length 595 [2025-02-05 11:39:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 60084 states and 65349 transitions. [2025-02-05 11:39:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 11:39:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60084 states and 65349 transitions. [2025-02-05 11:39:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-02-05 11:39:15,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:15,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:15,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 11:39:15,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 11:39:15,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:15,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1555844349, now seen corresponding path program 1 times [2025-02-05 11:39:15,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:15,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386568346] [2025-02-05 11:39:15,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:15,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-02-05 11:39:15,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-02-05 11:39:15,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-02-05 11:39:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386568346] [2025-02-05 11:39:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386568346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124767546] [2025-02-05 11:39:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:15,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:15,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:15,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:15,447 INFO L87 Difference]: Start difference. First operand 60084 states and 65349 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:17,962 INFO L93 Difference]: Finished difference Result 130680 states and 142487 transitions. [2025-02-05 11:39:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 597 [2025-02-05 11:39:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:18,026 INFO L225 Difference]: With dead ends: 130680 [2025-02-05 11:39:18,026 INFO L226 Difference]: Without dead ends: 70598 [2025-02-05 11:39:18,055 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 11:39:18,055 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 663 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:18,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1177 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70598 states. [2025-02-05 11:39:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70598 to 69847. [2025-02-05 11:39:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69847 states, 69846 states have (on average 1.0823526043008904) internal successors, (75598), 69846 states have internal predecessors, (75598), 0 states have call successors, (0), 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 11:39:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69847 states to 69847 states and 75598 transitions. [2025-02-05 11:39:18,538 INFO L78 Accepts]: Start accepts. Automaton has 69847 states and 75598 transitions. Word has length 597 [2025-02-05 11:39:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:18,538 INFO L471 AbstractCegarLoop]: Abstraction has 69847 states and 75598 transitions. [2025-02-05 11:39:18,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69847 states and 75598 transitions. [2025-02-05 11:39:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-02-05 11:39:18,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:18,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2025-02-05 11:39:18,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:39:18,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1564127309, now seen corresponding path program 1 times [2025-02-05 11:39:18,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238588487] [2025-02-05 11:39:18,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:18,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:18,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-02-05 11:39:18,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-02-05 11:39:18,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:18,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 11:39:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238588487] [2025-02-05 11:39:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238588487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882283368] [2025-02-05 11:39:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:18,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:18,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:18,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:18,879 INFO L87 Difference]: Start difference. First operand 69847 states and 75598 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:21,313 INFO L93 Difference]: Finished difference Result 159969 states and 173611 transitions. [2025-02-05 11:39:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 601 [2025-02-05 11:39:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:21,401 INFO L225 Difference]: With dead ends: 159969 [2025-02-05 11:39:21,401 INFO L226 Difference]: Without dead ends: 90124 [2025-02-05 11:39:21,443 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 11:39:21,445 INFO L435 NwaCegarLoop]: 1159 mSDtfsCounter, 678 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:21,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1167 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 11:39:21,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90124 states. [2025-02-05 11:39:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90124 to 89373. [2025-02-05 11:39:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89373 states, 89372 states have (on average 1.0797005773620374) internal successors, (96495), 89372 states have internal predecessors, (96495), 0 states have call successors, (0), 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 11:39:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89373 states to 89373 states and 96495 transitions. [2025-02-05 11:39:22,096 INFO L78 Accepts]: Start accepts. Automaton has 89373 states and 96495 transitions. Word has length 601 [2025-02-05 11:39:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 89373 states and 96495 transitions. [2025-02-05 11:39:22,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) 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 11:39:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 89373 states and 96495 transitions. [2025-02-05 11:39:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2025-02-05 11:39:22,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:22,109 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:39:22,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:22,109 INFO L85 PathProgramCache]: Analyzing trace with hash -399725111, now seen corresponding path program 1 times [2025-02-05 11:39:22,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020712460] [2025-02-05 11:39:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:22,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-02-05 11:39:22,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-02-05 11:39:22,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:22,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 144 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020712460] [2025-02-05 11:39:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020712460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960299934] [2025-02-05 11:39:23,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:39:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:39:23,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:39:23,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 11:39:23,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes. [2025-02-05 11:39:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements. [2025-02-05 11:39:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:23,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:23,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 11:39:23,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:39:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 293 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:39:24,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:39:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-05 11:39:26,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960299934] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:39:26,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:39:26,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 11 [2025-02-05 11:39:26,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216787737] [2025-02-05 11:39:26,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:26,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:26,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:39:26,500 INFO L87 Difference]: Start difference. First operand 89373 states and 96495 transitions. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 11:39:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:28,754 INFO L93 Difference]: Finished difference Result 190009 states and 205048 transitions. [2025-02-05 11:39:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:28,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 623 [2025-02-05 11:39:28,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:28,892 INFO L225 Difference]: With dead ends: 190009 [2025-02-05 11:39:28,892 INFO L226 Difference]: Without dead ends: 100638 [2025-02-05 11:39:28,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1251 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:39:28,942 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 467 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:28,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 71 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:39:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100638 states. [2025-02-05 11:39:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100638 to 98385. [2025-02-05 11:39:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.0652850056919825) internal successors, (104807), 98384 states have internal predecessors, (104807), 0 states have call successors, (0), 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 11:39:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 104807 transitions. [2025-02-05 11:39:29,910 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 104807 transitions. Word has length 623 [2025-02-05 11:39:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:29,911 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 104807 transitions. [2025-02-05 11:39:29,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 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 11:39:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 104807 transitions. [2025-02-05 11:39:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 11:39:29,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:29,926 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:39:29,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 11:39:30,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 11:39:30,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:30,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1646584477, now seen corresponding path program 1 times [2025-02-05 11:39:30,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:30,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444792808] [2025-02-05 11:39:30,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:30,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 11:39:30,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 11:39:30,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:30,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:30,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-02-05 11:39:30,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:30,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444792808] [2025-02-05 11:39:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444792808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:30,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:30,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519951732] [2025-02-05 11:39:30,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:30,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:30,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:30,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:30,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:30,346 INFO L87 Difference]: Start difference. First operand 98385 states and 104807 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 11:39:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:33,274 INFO L93 Difference]: Finished difference Result 224555 states and 239813 transitions. [2025-02-05 11:39:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:33,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 707 [2025-02-05 11:39:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:33,401 INFO L225 Difference]: With dead ends: 224555 [2025-02-05 11:39:33,401 INFO L226 Difference]: Without dead ends: 124670 [2025-02-05 11:39:33,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 11:39:33,443 INFO L435 NwaCegarLoop]: 1160 mSDtfsCounter, 696 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:33,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1167 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:39:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124670 states. [2025-02-05 11:39:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124670 to 120915. [2025-02-05 11:39:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120915 states, 120914 states have (on average 1.0517640637147063) internal successors, (127173), 120914 states have internal predecessors, (127173), 0 states have call successors, (0), 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 11:39:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120915 states to 120915 states and 127173 transitions. [2025-02-05 11:39:34,515 INFO L78 Accepts]: Start accepts. Automaton has 120915 states and 127173 transitions. Word has length 707 [2025-02-05 11:39:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:34,516 INFO L471 AbstractCegarLoop]: Abstraction has 120915 states and 127173 transitions. [2025-02-05 11:39:34,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 11:39:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 120915 states and 127173 transitions. [2025-02-05 11:39:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 11:39:34,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:34,532 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:34,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:39:34,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -460604431, now seen corresponding path program 1 times [2025-02-05 11:39:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12567939] [2025-02-05 11:39:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 11:39:34,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 11:39:34,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:34,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-02-05 11:39:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12567939] [2025-02-05 11:39:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12567939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:35,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118595714] [2025-02-05 11:39:35,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:35,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:35,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:35,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:35,366 INFO L87 Difference]: Start difference. First operand 120915 states and 127173 transitions. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 11:39:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:37,886 INFO L93 Difference]: Finished difference Result 244081 states and 256602 transitions. [2025-02-05 11:39:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:37,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 734 [2025-02-05 11:39:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:38,027 INFO L225 Difference]: With dead ends: 244081 [2025-02-05 11:39:38,028 INFO L226 Difference]: Without dead ends: 120164 [2025-02-05 11:39:38,100 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 11:39:38,101 INFO L435 NwaCegarLoop]: 1120 mSDtfsCounter, 589 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:38,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1128 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 11:39:38,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120164 states. [2025-02-05 11:39:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120164 to 114156. [2025-02-05 11:39:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114156 states, 114155 states have (on average 1.0350313170688976) internal successors, (118154), 114155 states have internal predecessors, (118154), 0 states have call successors, (0), 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 11:39:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114156 states to 114156 states and 118154 transitions. [2025-02-05 11:39:39,228 INFO L78 Accepts]: Start accepts. Automaton has 114156 states and 118154 transitions. Word has length 734 [2025-02-05 11:39:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:39,228 INFO L471 AbstractCegarLoop]: Abstraction has 114156 states and 118154 transitions. [2025-02-05 11:39:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 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 11:39:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 114156 states and 118154 transitions. [2025-02-05 11:39:39,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 885 [2025-02-05 11:39:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:39,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:39,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:39:39,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1821413908, now seen corresponding path program 1 times [2025-02-05 11:39:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821866055] [2025-02-05 11:39:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:39,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 884 statements into 1 equivalence classes. [2025-02-05 11:39:39,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 884 of 884 statements. [2025-02-05 11:39:39,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:39,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-05 11:39:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821866055] [2025-02-05 11:39:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821866055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991482528] [2025-02-05 11:39:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:39,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:39,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:39,751 INFO L87 Difference]: Start difference. First operand 114156 states and 118154 transitions. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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 11:39:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:42,487 INFO L93 Difference]: Finished difference Result 271117 states and 280613 transitions. [2025-02-05 11:39:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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 884 [2025-02-05 11:39:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:42,668 INFO L225 Difference]: With dead ends: 271117 [2025-02-05 11:39:42,668 INFO L226 Difference]: Without dead ends: 157714 [2025-02-05 11:39:42,744 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 11:39:42,745 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 543 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:42,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 193 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 11:39:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157714 states. [2025-02-05 11:39:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157714 to 122417. [2025-02-05 11:39:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122417 states, 122416 states have (on average 1.035183309371324) internal successors, (126723), 122416 states have internal predecessors, (126723), 0 states have call successors, (0), 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 11:39:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122417 states to 122417 states and 126723 transitions. [2025-02-05 11:39:44,417 INFO L78 Accepts]: Start accepts. Automaton has 122417 states and 126723 transitions. Word has length 884 [2025-02-05 11:39:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:44,419 INFO L471 AbstractCegarLoop]: Abstraction has 122417 states and 126723 transitions. [2025-02-05 11:39:44,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 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 11:39:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 122417 states and 126723 transitions. [2025-02-05 11:39:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2025-02-05 11:39:44,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:44,454 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:39:44,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:39:44,454 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 278508328, now seen corresponding path program 1 times [2025-02-05 11:39:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855367778] [2025-02-05 11:39:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:44,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 892 statements into 1 equivalence classes. [2025-02-05 11:39:44,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 892 of 892 statements. [2025-02-05 11:39:44,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:44,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-02-05 11:39:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:45,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855367778] [2025-02-05 11:39:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855367778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:45,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:45,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:39:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727168341] [2025-02-05 11:39:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:45,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:39:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:45,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:39:45,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:39:45,769 INFO L87 Difference]: Start difference. First operand 122417 states and 126723 transitions. Second operand has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 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 11:39:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:48,867 INFO L93 Difference]: Finished difference Result 257599 states and 266611 transitions. [2025-02-05 11:39:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:39:48,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 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 892 [2025-02-05 11:39:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:39:48,991 INFO L225 Difference]: With dead ends: 257599 [2025-02-05 11:39:48,991 INFO L226 Difference]: Without dead ends: 135935 [2025-02-05 11:39:49,058 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 11:39:49,059 INFO L435 NwaCegarLoop]: 1143 mSDtfsCounter, 918 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3726 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 3897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 3726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:39:49,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1157 Invalid, 3897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 3726 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:39:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135935 states. [2025-02-05 11:39:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135935 to 125421. [2025-02-05 11:39:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.0346276510923298) internal successors, (129763), 125420 states have internal predecessors, (129763), 0 states have call successors, (0), 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 11:39:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 129763 transitions. [2025-02-05 11:39:50,403 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 129763 transitions. Word has length 892 [2025-02-05 11:39:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:39:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 129763 transitions. [2025-02-05 11:39:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.5) internal successors, (758), 4 states have internal predecessors, (758), 0 states have call successors, (0), 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 11:39:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 129763 transitions. [2025-02-05 11:39:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2025-02-05 11:39:50,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:39:50,432 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:39:50,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:39:50,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:39:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:39:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 122769803, now seen corresponding path program 1 times [2025-02-05 11:39:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:39:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547539855] [2025-02-05 11:39:50,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:39:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:39:50,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 950 statements into 1 equivalence classes. [2025-02-05 11:39:50,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 950 of 950 statements. [2025-02-05 11:39:50,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:39:50,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:39:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-02-05 11:39:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:39:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547539855] [2025-02-05 11:39:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547539855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:39:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:39:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:39:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572598598] [2025-02-05 11:39:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:39:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:39:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:39:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:39:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:39:51,332 INFO L87 Difference]: Start difference. First operand 125421 states and 129763 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 11:39:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:39:53,843 INFO L93 Difference]: Finished difference Result 262856 states and 271763 transitions. [2025-02-05 11:39:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:39:53,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 950 [2025-02-05 11:39:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.