./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.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 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:35:04,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:35:04,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:35:04,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:35:04,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:35:04,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:35:04,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:35:04,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:35:04,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:35:04,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:35:04,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:35:04,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:35:04,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:35:04,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:35:04,732 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:35:04,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:35:04,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:35:04,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:35:04,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:04,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:35:04,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:35:04,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:35:04,735 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 -> 5a9891cd4c5f04616b7fa480ff51a2b34c717470141ef1b888630cca6069f53e [2025-02-05 17:35:04,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:35:04,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:35:04,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:35:04,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:35:04,954 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:35:04,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-02-05 17:35:06,103 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04036daef/c10440a008124db99c8da2f9e31b6991/FLAGd02e80c9e [2025-02-05 17:35:06,524 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:35:06,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-02-05 17:35:06,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04036daef/c10440a008124db99c8da2f9e31b6991/FLAGd02e80c9e [2025-02-05 17:35:06,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04036daef/c10440a008124db99c8da2f9e31b6991 [2025-02-05 17:35:06,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:35:06,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:35:06,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:06,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:35:06,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:35:06,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:06" (1/1) ... [2025-02-05 17:35:06,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153b80b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:06, skipping insertion in model container [2025-02-05 17:35:06,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:35:06" (1/1) ... [2025-02-05 17:35:06,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:35:07,070 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2025-02-05 17:35:07,128 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2025-02-05 17:35:07,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:07,666 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:35:07,691 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c[6450,6463] [2025-02-05 17:35:07,699 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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c[9957,9970] [2025-02-05 17:35:07,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:35:07,951 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:35:07,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07 WrapperNode [2025-02-05 17:35:07,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:35:07,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:07,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:35:07,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:35:07,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,258 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4977 [2025-02-05 17:35:08,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:35:08,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:35:08,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:35:08,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:35:08,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:35:08,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:35:08,692 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:35:08,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:35:08,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:35:08,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (1/1) ... [2025-02-05 17:35:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:35:08,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:08,717 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 17:35:08,723 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 17:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:35:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:35:08,818 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:35:08,820 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:35:12,738 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: havoc calculate_output_#t~ret29#1; [2025-02-05 17:35:12,739 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc calculate_output2_#t~ret30#1; [2025-02-05 17:35:12,739 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4956: havoc calculate_output3_#t~ret31#1; [2025-02-05 17:35:13,050 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-02-05 17:35:13,050 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:35:13,096 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:35:13,099 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:35:13,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:13 BoogieIcfgContainer [2025-02-05 17:35:13,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:35:13,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:35:13,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:35:13,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:35:13,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:35:06" (1/3) ... [2025-02-05 17:35:13,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d452129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:13, skipping insertion in model container [2025-02-05 17:35:13,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:35:07" (2/3) ... [2025-02-05 17:35:13,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d452129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:35:13, skipping insertion in model container [2025-02-05 17:35:13,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:35:13" (3/3) ... [2025-02-05 17:35:13,122 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-02-05 17:35:13,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:35:13,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label08.c that has 1 procedures, 873 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:35:13,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:35:13,293 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;@723035bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:35:13,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:35:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:13,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:13,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:13,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash 628275282, now seen corresponding path program 1 times [2025-02-05 17:35:13,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:13,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077882038] [2025-02-05 17:35:13,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:13,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:13,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:13,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:13,623 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 17:35:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077882038] [2025-02-05 17:35:13,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077882038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:13,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245433751] [2025-02-05 17:35:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:13,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:35:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:13,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:35:13,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:13,668 INFO L87 Difference]: Start difference. First operand has 873 states, 870 states have (on average 1.9045977011494253) internal successors, (1657), 872 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:13,797 INFO L93 Difference]: Finished difference Result 1723 states and 3273 transitions. [2025-02-05 17:35:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:35:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 17:35:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:13,825 INFO L225 Difference]: With dead ends: 1723 [2025-02-05 17:35:13,825 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 17:35:13,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:35:13,837 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:13,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:13,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 17:35:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-02-05 17:35:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8945409429280398) internal successors, (1527), 807 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1527 transitions. [2025-02-05 17:35:13,963 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1527 transitions. Word has length 20 [2025-02-05 17:35:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:13,964 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1527 transitions. [2025-02-05 17:35:13,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1527 transitions. [2025-02-05 17:35:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:35:13,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:13,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:13,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:35:13,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:13,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 122716657, now seen corresponding path program 1 times [2025-02-05 17:35:13,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:13,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863981509] [2025-02-05 17:35:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:13,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:35:14,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:35:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:14,286 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 17:35:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863981509] [2025-02-05 17:35:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863981509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:14,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251513304] [2025-02-05 17:35:14,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:14,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:14,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:14,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:14,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:14,290 INFO L87 Difference]: Start difference. First operand 808 states and 1527 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:14,447 INFO L93 Difference]: Finished difference Result 844 states and 1581 transitions. [2025-02-05 17:35:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:14,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2025-02-05 17:35:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:14,451 INFO L225 Difference]: With dead ends: 844 [2025-02-05 17:35:14,451 INFO L226 Difference]: Without dead ends: 808 [2025-02-05 17:35:14,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:14,458 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:14,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:14,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-02-05 17:35:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2025-02-05 17:35:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 1.8746898263027296) internal successors, (1511), 807 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1511 transitions. [2025-02-05 17:35:14,503 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1511 transitions. Word has length 20 [2025-02-05 17:35:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:14,504 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1511 transitions. [2025-02-05 17:35:14,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1511 transitions. [2025-02-05 17:35:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 17:35:14,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:14,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:14,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:35:14,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:14,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -955120361, now seen corresponding path program 1 times [2025-02-05 17:35:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:14,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497571302] [2025-02-05 17:35:14,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 17:35:14,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 17:35:14,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:14,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:14,660 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 17:35:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497571302] [2025-02-05 17:35:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497571302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:14,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:14,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:35:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054898478] [2025-02-05 17:35:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:14,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:14,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:14,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:14,666 INFO L87 Difference]: Start difference. First operand 808 states and 1511 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:17,496 INFO L93 Difference]: Finished difference Result 2312 states and 4384 transitions. [2025-02-05 17:35:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:17,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-05 17:35:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:17,502 INFO L225 Difference]: With dead ends: 2312 [2025-02-05 17:35:17,502 INFO L226 Difference]: Without dead ends: 1559 [2025-02-05 17:35:17,503 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 17:35:17,504 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 860 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:17,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 500 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 17:35:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-02-05 17:35:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-02-05 17:35:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1557 states have (on average 1.630057803468208) internal successors, (2538), 1558 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2538 transitions. [2025-02-05 17:35:17,537 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2538 transitions. Word has length 30 [2025-02-05 17:35:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2538 transitions. [2025-02-05 17:35:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2538 transitions. [2025-02-05 17:35:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 17:35:17,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:17,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:17,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:35:17,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:17,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:17,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1237708420, now seen corresponding path program 1 times [2025-02-05 17:35:17,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:17,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352605292] [2025-02-05 17:35:17,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:17,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 17:35:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 17:35:17,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:17,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:17,706 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 17:35:17,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:17,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352605292] [2025-02-05 17:35:17,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352605292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:17,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533358848] [2025-02-05 17:35:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:17,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:17,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:17,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:17,708 INFO L87 Difference]: Start difference. First operand 1559 states and 2538 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:17,778 INFO L93 Difference]: Finished difference Result 1751 states and 2838 transitions. [2025-02-05 17:35:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:35:17,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-05 17:35:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:17,783 INFO L225 Difference]: With dead ends: 1751 [2025-02-05 17:35:17,783 INFO L226 Difference]: Without dead ends: 1719 [2025-02-05 17:35:17,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:17,784 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 4644 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4644 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:17,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4644 Valid, 1789 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2025-02-05 17:35:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1589. [2025-02-05 17:35:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1587 states have (on average 1.6288594833018273) internal successors, (2585), 1588 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2585 transitions. [2025-02-05 17:35:17,809 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2585 transitions. Word has length 35 [2025-02-05 17:35:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:17,809 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2585 transitions. [2025-02-05 17:35:17,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2585 transitions. [2025-02-05 17:35:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:17,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:17,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:17,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:35:17,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash 852203871, now seen corresponding path program 1 times [2025-02-05 17:35:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335002047] [2025-02-05 17:35:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:17,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:17,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:17,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:17,870 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 17:35:17,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335002047] [2025-02-05 17:35:17,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335002047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:17,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:17,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202645262] [2025-02-05 17:35:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:17,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:17,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:17,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:17,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:17,871 INFO L87 Difference]: Start difference. First operand 1589 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:17,895 INFO L93 Difference]: Finished difference Result 1702 states and 2760 transitions. [2025-02-05 17:35:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:17,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 17:35:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:17,900 INFO L225 Difference]: With dead ends: 1702 [2025-02-05 17:35:17,900 INFO L226 Difference]: Without dead ends: 1640 [2025-02-05 17:35:17,900 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 17:35:17,901 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1468 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:17,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1550 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-02-05 17:35:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1636. [2025-02-05 17:35:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.6248470012239902) internal successors, (2655), 1635 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2655 transitions. [2025-02-05 17:35:17,920 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2655 transitions. Word has length 37 [2025-02-05 17:35:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:17,921 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2655 transitions. [2025-02-05 17:35:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2655 transitions. [2025-02-05 17:35:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:35:17,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:17,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:17,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:35:17,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 884527106, now seen corresponding path program 1 times [2025-02-05 17:35:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411943835] [2025-02-05 17:35:17,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:17,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:35:17,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:35:17,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:17,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,109 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 17:35:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411943835] [2025-02-05 17:35:18,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411943835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954835529] [2025-02-05 17:35:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:18,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:18,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:18,112 INFO L87 Difference]: Start difference. First operand 1636 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,182 INFO L93 Difference]: Finished difference Result 1747 states and 2823 transitions. [2025-02-05 17:35:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-05 17:35:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,187 INFO L225 Difference]: With dead ends: 1747 [2025-02-05 17:35:18,187 INFO L226 Difference]: Without dead ends: 1638 [2025-02-05 17:35:18,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:35:18,189 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1478 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1645 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-02-05 17:35:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1636. [2025-02-05 17:35:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1634 states have (on average 1.6236230110159118) internal successors, (2653), 1635 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2653 transitions. [2025-02-05 17:35:18,213 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2653 transitions. Word has length 37 [2025-02-05 17:35:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2653 transitions. [2025-02-05 17:35:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2653 transitions. [2025-02-05 17:35:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 17:35:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:18,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:35:18,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1681074244, now seen corresponding path program 1 times [2025-02-05 17:35:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548312144] [2025-02-05 17:35:18,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 17:35:18,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 17:35:18,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,425 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 17:35:18,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548312144] [2025-02-05 17:35:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548312144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:35:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667751765] [2025-02-05 17:35:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:35:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:35:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:18,426 INFO L87 Difference]: Start difference. First operand 1636 states and 2653 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,474 INFO L93 Difference]: Finished difference Result 1644 states and 2662 transitions. [2025-02-05 17:35:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:35:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 17:35:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,479 INFO L225 Difference]: With dead ends: 1644 [2025-02-05 17:35:18,479 INFO L226 Difference]: Without dead ends: 1642 [2025-02-05 17:35:18,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:35:18,480 INFO L435 NwaCegarLoop]: 1505 mSDtfsCounter, 0 mSDsluCounter, 9017 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10522 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10522 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2025-02-05 17:35:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2025-02-05 17:35:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1640 states have (on average 1.6207317073170733) internal successors, (2658), 1641 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2658 transitions. [2025-02-05 17:35:18,501 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2658 transitions. Word has length 38 [2025-02-05 17:35:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:18,502 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2658 transitions. [2025-02-05 17:35:18,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2658 transitions. [2025-02-05 17:35:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:18,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:18,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:35:18,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1052560352, now seen corresponding path program 1 times [2025-02-05 17:35:18,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765589812] [2025-02-05 17:35:18,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:18,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:18,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,537 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 17:35:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765589812] [2025-02-05 17:35:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765589812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765756842] [2025-02-05 17:35:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:18,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:18,539 INFO L87 Difference]: Start difference. First operand 1642 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,557 INFO L93 Difference]: Finished difference Result 1856 states and 2970 transitions. [2025-02-05 17:35:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 17:35:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,563 INFO L225 Difference]: With dead ends: 1856 [2025-02-05 17:35:18,563 INFO L226 Difference]: Without dead ends: 1741 [2025-02-05 17:35:18,564 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 17:35:18,564 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 1477 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1477 Valid, 1593 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2025-02-05 17:35:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1739. [2025-02-05 17:35:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1737 states have (on average 1.6090961427748993) internal successors, (2795), 1738 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2795 transitions. [2025-02-05 17:35:18,588 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2795 transitions. Word has length 39 [2025-02-05 17:35:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:18,589 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2795 transitions. [2025-02-05 17:35:18,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2795 transitions. [2025-02-05 17:35:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:35:18,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:35:18,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1539278624, now seen corresponding path program 1 times [2025-02-05 17:35:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954130766] [2025-02-05 17:35:18,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:35:18,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:35:18,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,627 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 17:35:18,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954130766] [2025-02-05 17:35:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954130766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772867185] [2025-02-05 17:35:18,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:18,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:18,629 INFO L87 Difference]: Start difference. First operand 1739 states and 2795 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,650 INFO L93 Difference]: Finished difference Result 2131 states and 3353 transitions. [2025-02-05 17:35:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-05 17:35:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,656 INFO L225 Difference]: With dead ends: 2131 [2025-02-05 17:35:18,656 INFO L226 Difference]: Without dead ends: 1919 [2025-02-05 17:35:18,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:18,658 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1475 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1595 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2025-02-05 17:35:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 1917. [2025-02-05 17:35:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1915 states have (on average 1.5859007832898173) internal successors, (3037), 1916 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 3037 transitions. [2025-02-05 17:35:18,688 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 3037 transitions. Word has length 39 [2025-02-05 17:35:18,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:18,688 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 3037 transitions. [2025-02-05 17:35:18,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 3037 transitions. [2025-02-05 17:35:18,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 17:35:18,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:18,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:35:18,689 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -285813920, now seen corresponding path program 1 times [2025-02-05 17:35:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033893646] [2025-02-05 17:35:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 17:35:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 17:35:18,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,729 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 17:35:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033893646] [2025-02-05 17:35:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033893646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933396001] [2025-02-05 17:35:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:18,730 INFO L87 Difference]: Start difference. First operand 1917 states and 3037 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,752 INFO L93 Difference]: Finished difference Result 2340 states and 3643 transitions. [2025-02-05 17:35:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-05 17:35:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,759 INFO L225 Difference]: With dead ends: 2340 [2025-02-05 17:35:18,759 INFO L226 Difference]: Without dead ends: 2105 [2025-02-05 17:35:18,760 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 17:35:18,761 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 1476 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-02-05 17:35:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2103. [2025-02-05 17:35:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 2101 states have (on average 1.5663969538315088) internal successors, (3291), 2102 states have internal predecessors, (3291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 3291 transitions. [2025-02-05 17:35:18,794 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 3291 transitions. Word has length 41 [2025-02-05 17:35:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:18,795 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 3291 transitions. [2025-02-05 17:35:18,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 3291 transitions. [2025-02-05 17:35:18,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:18,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:18,796 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:18,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:35:18,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:18,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -579892588, now seen corresponding path program 1 times [2025-02-05 17:35:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282530026] [2025-02-05 17:35:18,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:18,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:18,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:18,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:35:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:18,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282530026] [2025-02-05 17:35:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282530026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:18,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:18,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:18,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963571095] [2025-02-05 17:35:18,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:18,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:18,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:18,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:18,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:18,905 INFO L87 Difference]: Start difference. First operand 2103 states and 3291 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:18,974 INFO L93 Difference]: Finished difference Result 3959 states and 5871 transitions. [2025-02-05 17:35:18,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:18,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2025-02-05 17:35:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:18,983 INFO L225 Difference]: With dead ends: 3959 [2025-02-05 17:35:18,983 INFO L226 Difference]: Without dead ends: 3385 [2025-02-05 17:35:18,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:18,985 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3050 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3050 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:18,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3050 Valid, 3171 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:18,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-02-05 17:35:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2675. [2025-02-05 17:35:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2673 states have (on average 1.5260007482229705) internal successors, (4079), 2674 states have internal predecessors, (4079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4079 transitions. [2025-02-05 17:35:19,029 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4079 transitions. Word has length 54 [2025-02-05 17:35:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,030 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4079 transitions. [2025-02-05 17:35:19,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4079 transitions. [2025-02-05 17:35:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:35:19,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,031 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:35:19,031 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1066610860, now seen corresponding path program 1 times [2025-02-05 17:35:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512639443] [2025-02-05 17:35:19,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:35:19,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:35:19,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:35:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512639443] [2025-02-05 17:35:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512639443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668637199] [2025-02-05 17:35:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:19,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:19,126 INFO L87 Difference]: Start difference. First operand 2675 states and 4079 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,192 INFO L93 Difference]: Finished difference Result 4531 states and 6659 transitions. [2025-02-05 17:35:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:19,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 54 [2025-02-05 17:35:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,203 INFO L225 Difference]: With dead ends: 4531 [2025-02-05 17:35:19,203 INFO L226 Difference]: Without dead ends: 3957 [2025-02-05 17:35:19,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:19,205 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 3059 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 3148 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3957 states. [2025-02-05 17:35:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3957 to 3535. [2025-02-05 17:35:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 3533 states have (on average 1.486272289838664) internal successors, (5251), 3534 states have internal predecessors, (5251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5251 transitions. [2025-02-05 17:35:19,261 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5251 transitions. Word has length 54 [2025-02-05 17:35:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5251 transitions. [2025-02-05 17:35:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5251 transitions. [2025-02-05 17:35:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:35:19,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,262 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:19,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:35:19,262 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2073319406, now seen corresponding path program 1 times [2025-02-05 17:35:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93912024] [2025-02-05 17:35:19,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:35:19,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:35:19,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93912024] [2025-02-05 17:35:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93912024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029880021] [2025-02-05 17:35:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:19,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:19,330 INFO L87 Difference]: Start difference. First operand 3535 states and 5251 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,361 INFO L93 Difference]: Finished difference Result 5011 states and 7314 transitions. [2025-02-05 17:35:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 17:35:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,375 INFO L225 Difference]: With dead ends: 5011 [2025-02-05 17:35:19,377 INFO L226 Difference]: Without dead ends: 3005 [2025-02-05 17:35:19,379 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 17:35:19,379 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 34 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-02-05 17:35:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 3003. [2025-02-05 17:35:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 3001 states have (on average 1.5071642785738086) internal successors, (4523), 3002 states have internal predecessors, (4523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 4523 transitions. [2025-02-05 17:35:19,424 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 4523 transitions. Word has length 56 [2025-02-05 17:35:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 3003 states and 4523 transitions. [2025-02-05 17:35:19,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 4523 transitions. [2025-02-05 17:35:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:35:19,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:19,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:35:19,426 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1318626092, now seen corresponding path program 1 times [2025-02-05 17:35:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159545905] [2025-02-05 17:35:19,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:35:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:35:19,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:19,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159545905] [2025-02-05 17:35:19,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159545905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:35:19,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126485318] [2025-02-05 17:35:19,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:35:19,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:35:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:35:19,500 INFO L87 Difference]: Start difference. First operand 3003 states and 4523 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,564 INFO L93 Difference]: Finished difference Result 4259 states and 6279 transitions. [2025-02-05 17:35:19,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:35:19,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 [2025-02-05 17:35:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,574 INFO L225 Difference]: With dead ends: 4259 [2025-02-05 17:35:19,577 INFO L226 Difference]: Without dead ends: 3841 [2025-02-05 17:35:19,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:35:19,579 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 3051 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 3174 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2025-02-05 17:35:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3419. [2025-02-05 17:35:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.492244659057653) internal successors, (5099), 3418 states have internal predecessors, (5099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5099 transitions. [2025-02-05 17:35:19,635 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5099 transitions. Word has length 56 [2025-02-05 17:35:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5099 transitions. [2025-02-05 17:35:19,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5099 transitions. [2025-02-05 17:35:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:35:19,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,637 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] [2025-02-05 17:35:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:35:19,637 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -431595430, now seen corresponding path program 1 times [2025-02-05 17:35:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793856435] [2025-02-05 17:35:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:35:19,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:35:19,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:19,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793856435] [2025-02-05 17:35:19,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793856435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564917083] [2025-02-05 17:35:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:19,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:19,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:19,703 INFO L87 Difference]: Start difference. First operand 3419 states and 5099 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,726 INFO L93 Difference]: Finished difference Result 4359 states and 6397 transitions. [2025-02-05 17:35:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 17:35:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,810 INFO L225 Difference]: With dead ends: 4359 [2025-02-05 17:35:19,810 INFO L226 Difference]: Without dead ends: 2485 [2025-02-05 17:35:19,812 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 17:35:19,812 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 29 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-02-05 17:35:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-02-05 17:35:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5255945183393793) internal successors, (3785), 2482 states have internal predecessors, (3785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3785 transitions. [2025-02-05 17:35:19,837 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3785 transitions. Word has length 57 [2025-02-05 17:35:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,838 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3785 transitions. [2025-02-05 17:35:19,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3785 transitions. [2025-02-05 17:35:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 17:35:19,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:35:19,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:35:19,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1723141375, now seen corresponding path program 1 times [2025-02-05 17:35:19,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048358607] [2025-02-05 17:35:19,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:35:19,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:35:19,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:19,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:19,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048358607] [2025-02-05 17:35:19,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048358607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:35:19,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:35:19,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:35:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728604053] [2025-02-05 17:35:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:35:19,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:35:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:19,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:35:19,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:35:19,889 INFO L87 Difference]: Start difference. First operand 2483 states and 3785 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:19,907 INFO L93 Difference]: Finished difference Result 2955 states and 4426 transitions. [2025-02-05 17:35:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:35:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 17:35:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:19,910 INFO L225 Difference]: With dead ends: 2955 [2025-02-05 17:35:19,910 INFO L226 Difference]: Without dead ends: 2017 [2025-02-05 17:35:19,911 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 17:35:19,911 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 26 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:19,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3001 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:35:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-02-05 17:35:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2015. [2025-02-05 17:35:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 2013 states have (on average 1.5583705911574763) internal successors, (3137), 2014 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3137 transitions. [2025-02-05 17:35:19,929 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3137 transitions. Word has length 59 [2025-02-05 17:35:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:19,929 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3137 transitions. [2025-02-05 17:35:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3137 transitions. [2025-02-05 17:35:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:35:19,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:19,930 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:19,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:35:19,930 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1954883896, now seen corresponding path program 1 times [2025-02-05 17:35:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400257203] [2025-02-05 17:35:19,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:19,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:19,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:21,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400257203] [2025-02-05 17:35:21,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400257203] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:21,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134694960] [2025-02-05 17:35:21,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:21,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:21,022 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 17:35:21,026 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 17:35:21,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:35:21,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:35:21,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:21,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:21,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 17:35:21,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:21,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:35:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134694960] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:21,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:21,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-02-05 17:35:21,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429849974] [2025-02-05 17:35:21,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:21,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 17:35:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:21,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 17:35:21,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-05 17:35:21,365 INFO L87 Difference]: Start difference. First operand 2015 states and 3137 transitions. Second operand has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:23,439 INFO L93 Difference]: Finished difference Result 4460 states and 6355 transitions. [2025-02-05 17:35:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-05 17:35:23,440 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 17:35:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:23,447 INFO L225 Difference]: With dead ends: 4460 [2025-02-05 17:35:23,447 INFO L226 Difference]: Without dead ends: 3990 [2025-02-05 17:35:23,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=809, Invalid=3351, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 17:35:23,449 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 17199 mSDsluCounter, 6191 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17199 SdHoareTripleChecker+Valid, 7690 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:23,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17199 Valid, 7690 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:35:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2025-02-05 17:35:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3912. [2025-02-05 17:35:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3910 states have (on average 1.4020460358056266) internal successors, (5482), 3911 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 5482 transitions. [2025-02-05 17:35:23,506 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 5482 transitions. Word has length 61 [2025-02-05 17:35:23,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:23,507 INFO L471 AbstractCegarLoop]: Abstraction has 3912 states and 5482 transitions. [2025-02-05 17:35:23,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.736842105263158) internal successors, (166), 19 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 5482 transitions. [2025-02-05 17:35:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:23,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:23,508 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:23,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:35:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 17:35:23,709 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:23,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -250404215, now seen corresponding path program 1 times [2025-02-05 17:35:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461765079] [2025-02-05 17:35:23,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:23,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:23,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:23,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:23,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:23,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461765079] [2025-02-05 17:35:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461765079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623668620] [2025-02-05 17:35:23,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:23,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:23,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:23,948 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 17:35:23,950 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 17:35:23,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:24,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:24,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 17:35:24,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:24,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623668620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:24,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 17:35:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260683724] [2025-02-05 17:35:24,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 17:35:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 17:35:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-02-05 17:35:24,679 INFO L87 Difference]: Start difference. First operand 3912 states and 5482 transitions. Second operand has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:25,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:25,042 INFO L93 Difference]: Finished difference Result 6056 states and 8186 transitions. [2025-02-05 17:35:25,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:35:25,043 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 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 62 [2025-02-05 17:35:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:25,049 INFO L225 Difference]: With dead ends: 6056 [2025-02-05 17:35:25,050 INFO L226 Difference]: Without dead ends: 4018 [2025-02-05 17:35:25,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=237, Invalid=693, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:35:25,052 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 13709 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13709 SdHoareTripleChecker+Valid, 4631 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:25,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13709 Valid, 4631 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:35:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2025-02-05 17:35:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 3710. [2025-02-05 17:35:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 3708 states have (on average 1.4018338727076591) internal successors, (5198), 3709 states have internal predecessors, (5198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5198 transitions. [2025-02-05 17:35:25,134 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5198 transitions. Word has length 62 [2025-02-05 17:35:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:25,135 INFO L471 AbstractCegarLoop]: Abstraction has 3710 states and 5198 transitions. [2025-02-05 17:35:25,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.571428571428571) internal successors, (138), 20 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5198 transitions. [2025-02-05 17:35:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:25,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:25,136 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:25,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:35:25,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 17:35:25,338 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:25,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2031332521, now seen corresponding path program 1 times [2025-02-05 17:35:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362911744] [2025-02-05 17:35:25,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:25,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:25,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:25,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:25,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362911744] [2025-02-05 17:35:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362911744] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:25,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989008695] [2025-02-05 17:35:25,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:25,587 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 17:35:25,588 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 17:35:25,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:25,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:25,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:25,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:35:25,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:26,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:26,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989008695] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:26,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:26,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 29 [2025-02-05 17:35:26,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462399981] [2025-02-05 17:35:26,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:26,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 17:35:26,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:26,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 17:35:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2025-02-05 17:35:26,635 INFO L87 Difference]: Start difference. First operand 3710 states and 5198 transitions. Second operand has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:27,108 INFO L93 Difference]: Finished difference Result 7651 states and 10147 transitions. [2025-02-05 17:35:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:35:27,108 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 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 62 [2025-02-05 17:35:27,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:27,116 INFO L225 Difference]: With dead ends: 7651 [2025-02-05 17:35:27,116 INFO L226 Difference]: Without dead ends: 5864 [2025-02-05 17:35:27,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1250, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 17:35:27,119 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 14843 mSDsluCounter, 7680 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14843 SdHoareTripleChecker+Valid, 9175 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:27,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14843 Valid, 9175 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:35:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5864 states. [2025-02-05 17:35:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5864 to 5798. [2025-02-05 17:35:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5798 states, 5796 states have (on average 1.33367839889579) internal successors, (7730), 5797 states have internal predecessors, (7730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 7730 transitions. [2025-02-05 17:35:27,202 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 7730 transitions. Word has length 62 [2025-02-05 17:35:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:27,203 INFO L471 AbstractCegarLoop]: Abstraction has 5798 states and 7730 transitions. [2025-02-05 17:35:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.379310344827586) internal successors, (156), 29 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 7730 transitions. [2025-02-05 17:35:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:35:27,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:27,204 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:27,210 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 17:35:27,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:27,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:27,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1177805111, now seen corresponding path program 1 times [2025-02-05 17:35:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531569686] [2025-02-05 17:35:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:27,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:27,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:27,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531569686] [2025-02-05 17:35:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531569686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:27,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236732324] [2025-02-05 17:35:27,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:27,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:27,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:27,643 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 17:35:27,645 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 17:35:27,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:35:27,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:35:27,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:27,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 17:35:27,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:28,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:28,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236732324] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:28,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:28,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-05 17:35:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258591587] [2025-02-05 17:35:28,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 17:35:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:28,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 17:35:28,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-02-05 17:35:28,774 INFO L87 Difference]: Start difference. First operand 5798 states and 7730 transitions. Second operand has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:35:30,468 INFO L93 Difference]: Finished difference Result 12055 states and 15487 transitions. [2025-02-05 17:35:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-05 17:35:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 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 62 [2025-02-05 17:35:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:35:30,480 INFO L225 Difference]: With dead ends: 12055 [2025-02-05 17:35:30,481 INFO L226 Difference]: Without dead ends: 8291 [2025-02-05 17:35:30,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=704, Invalid=2836, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 17:35:30,487 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 16948 mSDsluCounter, 15109 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16948 SdHoareTripleChecker+Valid, 16618 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:35:30,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16948 Valid, 16618 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:35:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2025-02-05 17:35:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 8279. [2025-02-05 17:35:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8277 states have (on average 1.2918931980186057) internal successors, (10693), 8278 states have internal predecessors, (10693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 10693 transitions. [2025-02-05 17:35:30,714 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 10693 transitions. Word has length 62 [2025-02-05 17:35:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:35:30,714 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 10693 transitions. [2025-02-05 17:35:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.642857142857143) internal successors, (158), 28 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:35:30,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 10693 transitions. [2025-02-05 17:35:30,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:35:30,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:35:30,716 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:35:30,722 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 17:35:30,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:30,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:35:30,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:35:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1578127067, now seen corresponding path program 1 times [2025-02-05 17:35:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:35:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538912150] [2025-02-05 17:35:30,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:35:30,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:35:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:35:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:31,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:31,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:35:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538912150] [2025-02-05 17:35:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538912150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:35:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770425566] [2025-02-05 17:35:31,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:35:31,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:35:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:35:31,516 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 17:35:31,520 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 17:35:31,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:35:31,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:35:31,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:35:31,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:35:31,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-05 17:35:31,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:35:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:33,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:35:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:35:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770425566] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:35:35,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:35:35,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 20] total 49 [2025-02-05 17:35:35,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619942492] [2025-02-05 17:35:35,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:35:35,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-05 17:35:35,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:35:35,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-05 17:35:35,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2025-02-05 17:35:35,720 INFO L87 Difference]: Start difference. First operand 8279 states and 10693 transitions. Second operand has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:00,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:36:00,644 INFO L93 Difference]: Finished difference Result 23994 states and 29878 transitions. [2025-02-05 17:36:00,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2025-02-05 17:36:00,644 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 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 63 [2025-02-05 17:36:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:36:00,666 INFO L225 Difference]: With dead ends: 23994 [2025-02-05 17:36:00,666 INFO L226 Difference]: Without dead ends: 19834 [2025-02-05 17:36:00,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18967 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=6870, Invalid=43530, Unknown=0, NotChecked=0, Total=50400 [2025-02-05 17:36:00,678 INFO L435 NwaCegarLoop]: 1609 mSDtfsCounter, 24698 mSDsluCounter, 27033 mSDsCounter, 0 mSdLazyCounter, 3378 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24698 SdHoareTripleChecker+Valid, 28642 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 3378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:36:00,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24698 Valid, 28642 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 3378 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 17:36:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2025-02-05 17:36:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 7836. [2025-02-05 17:36:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7836 states, 7834 states have (on average 1.2997191728363544) internal successors, (10182), 7835 states have internal predecessors, (10182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7836 states to 7836 states and 10182 transitions. [2025-02-05 17:36:00,999 INFO L78 Accepts]: Start accepts. Automaton has 7836 states and 10182 transitions. Word has length 63 [2025-02-05 17:36:00,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:36:00,999 INFO L471 AbstractCegarLoop]: Abstraction has 7836 states and 10182 transitions. [2025-02-05 17:36:00,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.5306122448979593) internal successors, (173), 49 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:36:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 7836 states and 10182 transitions. [2025-02-05 17:36:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:36:01,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:36:01,000 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 17:36:01,006 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 17:36:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:01,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:36:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:36:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -76088125, now seen corresponding path program 1 times [2025-02-05 17:36:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:36:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572888319] [2025-02-05 17:36:01,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:36:01,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:36:01,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:36:01,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:01,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:36:02,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572888319] [2025-02-05 17:36:02,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572888319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:36:02,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594221543] [2025-02-05 17:36:02,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:36:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:36:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:36:02,383 INFO L229 MonitoredProcess]: Starting monitored process 7 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 17:36:02,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:36:02,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:36:02,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:36:02,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:36:02,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:36:02,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-05 17:36:02,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:36:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:03,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:36:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:36:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594221543] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:36:06,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:36:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 54 [2025-02-05 17:36:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965866383] [2025-02-05 17:36:06,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:36:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-05 17:36:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:36:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-05 17:36:06,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-02-05 17:36:06,148 INFO L87 Difference]: Start difference. First operand 7836 states and 10182 transitions. Second operand has 54 states, 54 states have (on average 3.1666666666666665) internal successors, (171), 54 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)