./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i -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 c3ee8afe098f9cee5b6405d2c58537794155bf2d3eb94d980df01b95a4a7b9e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:40:35,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:40:35,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:40:35,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:40:35,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:40:35,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:40:35,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:40:35,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:40:35,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:40:35,708 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:40:35,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:40:35,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:40:35,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:40:35,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:40:35,710 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:40:35,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:40:35,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:40:35,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:40:35,711 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:40:35,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:35,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:40:35,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:40:35,712 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 -> c3ee8afe098f9cee5b6405d2c58537794155bf2d3eb94d980df01b95a4a7b9e4 [2025-02-05 21:40:36,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:40:36,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:40:36,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:40:36,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:40:36,016 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:40:36,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-02-05 21:40:37,170 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec86f3c0/712d2ba49ea1413f884de04ef845c0c0/FLAG25d83695c [2025-02-05 21:40:37,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:40:37,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-02-05 21:40:37,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec86f3c0/712d2ba49ea1413f884de04ef845c0c0/FLAG25d83695c [2025-02-05 21:40:37,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eec86f3c0/712d2ba49ea1413f884de04ef845c0c0 [2025-02-05 21:40:37,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:40:37,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:40:37,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:37,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:40:37,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:40:37,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:37,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37, skipping insertion in model container [2025-02-05 21:40:37,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:37,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:40:37,829 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i[916,929] [2025-02-05 21:40:37,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:37,913 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:40:37,919 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-86.i[916,929] [2025-02-05 21:40:37,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:40:37,964 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:40:37,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37 WrapperNode [2025-02-05 21:40:37,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:40:37,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:37,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:40:37,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:40:37,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:37,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,011 INFO L138 Inliner]: procedures = 26, calls = 82, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 536 [2025-02-05 21:40:38,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:40:38,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:40:38,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:40:38,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:40:38,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,036 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 21:40:38,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:40:38,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:40:38,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:40:38,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:40:38,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (1/1) ... [2025-02-05 21:40:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:40:38,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:38,088 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 21:40:38,090 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 21:40:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:40:38,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:40:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:40:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:40:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:40:38,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:40:38,221 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:40:38,225 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:40:38,898 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-05 21:40:38,898 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:40:38,915 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:40:38,915 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:40:38,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:38 BoogieIcfgContainer [2025-02-05 21:40:38,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:40:38,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:40:38,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:40:38,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:40:38,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:40:37" (1/3) ... [2025-02-05 21:40:38,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe82d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:38, skipping insertion in model container [2025-02-05 21:40:38,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:40:37" (2/3) ... [2025-02-05 21:40:38,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe82d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:40:38, skipping insertion in model container [2025-02-05 21:40:38,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:40:38" (3/3) ... [2025-02-05 21:40:38,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-86.i [2025-02-05 21:40:38,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:40:38,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-86.i that has 2 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:40:38,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:40:38,974 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;@6fe99333, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:40:38,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:40:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 150 states have (on average 1.56) internal successors, (234), 151 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 21:40:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:38,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:38,990 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:38,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:38,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:38,993 INFO L85 PathProgramCache]: Analyzing trace with hash -265470075, now seen corresponding path program 1 times [2025-02-05 21:40:38,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:38,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225450235] [2025-02-05 21:40:38,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:38,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:39,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:39,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:39,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:39,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-02-05 21:40:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225450235] [2025-02-05 21:40:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225450235] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:40:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335783984] [2025-02-05 21:40:39,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:39,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:40:39,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:40:39,367 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 21:40:39,368 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 21:40:39,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:39,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:39,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:39,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:40:39,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:40:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 9248 trivial. 0 not checked. [2025-02-05 21:40:39,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:40:39,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335783984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:39,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:40:39,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:40:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144286266] [2025-02-05 21:40:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:39,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:40:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:39,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:40:39,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:40:39,685 INFO L87 Difference]: Start difference. First operand has 222 states, 150 states have (on average 1.56) internal successors, (234), 151 states have internal predecessors, (234), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:39,751 INFO L93 Difference]: Finished difference Result 437 states and 806 transitions. [2025-02-05 21:40:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:40:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) Word has length 441 [2025-02-05 21:40:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:39,758 INFO L225 Difference]: With dead ends: 437 [2025-02-05 21:40:39,759 INFO L226 Difference]: Without dead ends: 218 [2025-02-05 21:40:39,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 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 21:40:39,763 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:39,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-05 21:40:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-05 21:40:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 147 states have internal predecessors, (224), 69 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-05 21:40:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 362 transitions. [2025-02-05 21:40:39,816 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 362 transitions. Word has length 441 [2025-02-05 21:40:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:39,816 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 362 transitions. [2025-02-05 21:40:39,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 2 states have call successors, (69), 2 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 362 transitions. [2025-02-05 21:40:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:39,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:39,827 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:39,834 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 21:40:40,027 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,SelfDestructingSolverStorable0 [2025-02-05 21:40:40,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:40,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 834225640, now seen corresponding path program 1 times [2025-02-05 21:40:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116149007] [2025-02-05 21:40:40,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:40,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:40,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:40,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:40,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116149007] [2025-02-05 21:40:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116149007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:40,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861690386] [2025-02-05 21:40:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:40,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:40,495 INFO L87 Difference]: Start difference. First operand 218 states and 362 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:40,577 INFO L93 Difference]: Finished difference Result 562 states and 938 transitions. [2025-02-05 21:40:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:40,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-02-05 21:40:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:40,582 INFO L225 Difference]: With dead ends: 562 [2025-02-05 21:40:40,582 INFO L226 Difference]: Without dead ends: 347 [2025-02-05 21:40:40,587 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 21:40:40,587 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 209 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:40,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 863 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-05 21:40:40,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2025-02-05 21:40:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 257 states have (on average 1.583657587548638) internal successors, (407), 258 states have internal predecessors, (407), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:40:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 575 transitions. [2025-02-05 21:40:40,630 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 575 transitions. Word has length 441 [2025-02-05 21:40:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:40,632 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 575 transitions. [2025-02-05 21:40:40,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 575 transitions. [2025-02-05 21:40:40,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:40,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:40,639 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:40,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:40:40,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1031695014, now seen corresponding path program 1 times [2025-02-05 21:40:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:40,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615834830] [2025-02-05 21:40:40,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:40,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:40,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:40,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:40,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:40,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615834830] [2025-02-05 21:40:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615834830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:40,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604213770] [2025-02-05 21:40:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:40,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:40,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:40,886 INFO L87 Difference]: Start difference. First operand 344 states and 575 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:40,971 INFO L93 Difference]: Finished difference Result 1020 states and 1707 transitions. [2025-02-05 21:40:40,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:40,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-02-05 21:40:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:40,976 INFO L225 Difference]: With dead ends: 1020 [2025-02-05 21:40:40,977 INFO L226 Difference]: Without dead ends: 679 [2025-02-05 21:40:40,978 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 21:40:40,978 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 326 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:40,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 910 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:40:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-05 21:40:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2025-02-05 21:40:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 504 states have (on average 1.5595238095238095) internal successors, (786), 506 states have internal predecessors, (786), 168 states have call successors, (168), 4 states have call predecessors, (168), 4 states have return successors, (168), 166 states have call predecessors, (168), 168 states have call successors, (168) [2025-02-05 21:40:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1122 transitions. [2025-02-05 21:40:41,057 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1122 transitions. Word has length 441 [2025-02-05 21:40:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:41,057 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1122 transitions. [2025-02-05 21:40:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1122 transitions. [2025-02-05 21:40:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:41,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:41,062 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:40:41,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1218673435, now seen corresponding path program 1 times [2025-02-05 21:40:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621304807] [2025-02-05 21:40:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:41,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:41,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:41,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621304807] [2025-02-05 21:40:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621304807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:40:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667140] [2025-02-05 21:40:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:40:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:41,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:40:41,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:40:41,546 INFO L87 Difference]: Start difference. First operand 677 states and 1122 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:41,937 INFO L93 Difference]: Finished difference Result 1805 states and 3002 transitions. [2025-02-05 21:40:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:40:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-02-05 21:40:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:41,944 INFO L225 Difference]: With dead ends: 1805 [2025-02-05 21:40:41,944 INFO L226 Difference]: Without dead ends: 1131 [2025-02-05 21:40:41,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:40:41,946 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 355 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:41,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1239 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:40:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-02-05 21:40:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1057. [2025-02-05 21:40:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 814 states have (on average 1.5872235872235871) internal successors, (1292), 816 states have internal predecessors, (1292), 237 states have call successors, (237), 5 states have call predecessors, (237), 5 states have return successors, (237), 235 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-05 21:40:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1766 transitions. [2025-02-05 21:40:42,065 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1766 transitions. Word has length 441 [2025-02-05 21:40:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1766 transitions. [2025-02-05 21:40:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1766 transitions. [2025-02-05 21:40:42,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:42,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:42,070 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:42,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:40:42,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1724232060, now seen corresponding path program 1 times [2025-02-05 21:40:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413432501] [2025-02-05 21:40:42,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:42,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:42,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:42,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:42,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413432501] [2025-02-05 21:40:42,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413432501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:42,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:42,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:40:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827340656] [2025-02-05 21:40:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:42,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:40:42,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:42,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:40:42,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:40:42,982 INFO L87 Difference]: Start difference. First operand 1057 states and 1766 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:44,971 INFO L93 Difference]: Finished difference Result 4685 states and 7825 transitions. [2025-02-05 21:40:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:40:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 441 [2025-02-05 21:40:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:44,991 INFO L225 Difference]: With dead ends: 4685 [2025-02-05 21:40:44,992 INFO L226 Difference]: Without dead ends: 3889 [2025-02-05 21:40:44,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:40:44,996 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1174 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:44,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 2554 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 21:40:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3889 states. [2025-02-05 21:40:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3889 to 3155. [2025-02-05 21:40:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 2529 states have (on average 1.6022143139580862) internal successors, (4052), 2543 states have internal predecessors, (4052), 603 states have call successors, (603), 22 states have call predecessors, (603), 22 states have return successors, (603), 589 states have call predecessors, (603), 603 states have call successors, (603) [2025-02-05 21:40:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 5258 transitions. [2025-02-05 21:40:45,192 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 5258 transitions. Word has length 441 [2025-02-05 21:40:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:45,195 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 5258 transitions. [2025-02-05 21:40:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 5258 transitions. [2025-02-05 21:40:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:45,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:45,205 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:45,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:40:45,205 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -754651037, now seen corresponding path program 1 times [2025-02-05 21:40:45,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:45,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337563748] [2025-02-05 21:40:45,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:45,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:45,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:47,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337563748] [2025-02-05 21:40:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337563748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:47,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:40:47,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093906800] [2025-02-05 21:40:47,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:47,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:40:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:47,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:40:47,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:40:47,282 INFO L87 Difference]: Start difference. First operand 3155 states and 5258 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:48,647 INFO L93 Difference]: Finished difference Result 11179 states and 18644 transitions. [2025-02-05 21:40:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:40:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 441 [2025-02-05 21:40:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:48,709 INFO L225 Difference]: With dead ends: 11179 [2025-02-05 21:40:48,710 INFO L226 Difference]: Without dead ends: 8351 [2025-02-05 21:40:48,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:40:48,714 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 686 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:48,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1080 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:40:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8351 states. [2025-02-05 21:40:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8351 to 6017. [2025-02-05 21:40:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6017 states, 5046 states have (on average 1.6304003170828378) internal successors, (8227), 5076 states have internal predecessors, (8227), 927 states have call successors, (927), 43 states have call predecessors, (927), 43 states have return successors, (927), 897 states have call predecessors, (927), 927 states have call successors, (927) [2025-02-05 21:40:49,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6017 states to 6017 states and 10081 transitions. [2025-02-05 21:40:49,083 INFO L78 Accepts]: Start accepts. Automaton has 6017 states and 10081 transitions. Word has length 441 [2025-02-05 21:40:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:49,084 INFO L471 AbstractCegarLoop]: Abstraction has 6017 states and 10081 transitions. [2025-02-05 21:40:49,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6017 states and 10081 transitions. [2025-02-05 21:40:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:49,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:49,090 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:49,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:40:49,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:49,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1216288420, now seen corresponding path program 1 times [2025-02-05 21:40:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:49,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506610996] [2025-02-05 21:40:49,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:49,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:49,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:49,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:49,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506610996] [2025-02-05 21:40:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506610996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:49,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:40:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243898331] [2025-02-05 21:40:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:49,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:40:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:49,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:40:49,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:40:49,571 INFO L87 Difference]: Start difference. First operand 6017 states and 10081 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:50,515 INFO L93 Difference]: Finished difference Result 19352 states and 32300 transitions. [2025-02-05 21:40:50,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:40:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) Word has length 441 [2025-02-05 21:40:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:50,571 INFO L225 Difference]: With dead ends: 19352 [2025-02-05 21:40:50,571 INFO L226 Difference]: Without dead ends: 13946 [2025-02-05 21:40:50,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:40:50,584 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 513 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 2049 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:50,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 2049 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:40:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13946 states. [2025-02-05 21:40:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13946 to 13840. [2025-02-05 21:40:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13840 states, 11566 states have (on average 1.619661075566315) internal successors, (18733), 11642 states have internal predecessors, (18733), 2169 states have call successors, (2169), 104 states have call predecessors, (2169), 104 states have return successors, (2169), 2093 states have call predecessors, (2169), 2169 states have call successors, (2169) [2025-02-05 21:40:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13840 states to 13840 states and 23071 transitions. [2025-02-05 21:40:51,365 INFO L78 Accepts]: Start accepts. Automaton has 13840 states and 23071 transitions. Word has length 441 [2025-02-05 21:40:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:51,366 INFO L471 AbstractCegarLoop]: Abstraction has 13840 states and 23071 transitions. [2025-02-05 21:40:51,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 2 states have call predecessors, (69), 2 states have call successors, (69) [2025-02-05 21:40:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 13840 states and 23071 transitions. [2025-02-05 21:40:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-05 21:40:51,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:51,378 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:51,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:40:51,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:51,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -343080831, now seen corresponding path program 1 times [2025-02-05 21:40:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235026067] [2025-02-05 21:40:51,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:51,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-05 21:40:51,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-05 21:40:51,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:51,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:51,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235026067] [2025-02-05 21:40:51,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235026067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:51,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:51,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:40:51,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323079775] [2025-02-05 21:40:51,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:51,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:40:51,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:51,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:40:51,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:40:51,699 INFO L87 Difference]: Start difference. First operand 13840 states and 23071 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:52,136 INFO L93 Difference]: Finished difference Result 24788 states and 41200 transitions. [2025-02-05 21:40:52,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:40:52,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 441 [2025-02-05 21:40:52,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:52,178 INFO L225 Difference]: With dead ends: 24788 [2025-02-05 21:40:52,178 INFO L226 Difference]: Without dead ends: 13920 [2025-02-05 21:40:52,203 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 21:40:52,204 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:52,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:40:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13920 states. [2025-02-05 21:40:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13920 to 13920. [2025-02-05 21:40:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13920 states, 11646 states have (on average 1.6154044307058217) internal successors, (18813), 11722 states have internal predecessors, (18813), 2169 states have call successors, (2169), 104 states have call predecessors, (2169), 104 states have return successors, (2169), 2093 states have call predecessors, (2169), 2169 states have call successors, (2169) [2025-02-05 21:40:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13920 states to 13920 states and 23151 transitions. [2025-02-05 21:40:52,806 INFO L78 Accepts]: Start accepts. Automaton has 13920 states and 23151 transitions. Word has length 441 [2025-02-05 21:40:52,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:40:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 13920 states and 23151 transitions. [2025-02-05 21:40:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:40:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 13920 states and 23151 transitions. [2025-02-05 21:40:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 21:40:52,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:40:52,816 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:40:52,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:40:52,817 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:40:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:40:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1517257065, now seen corresponding path program 1 times [2025-02-05 21:40:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:40:52,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625634755] [2025-02-05 21:40:52,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:40:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:40:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 21:40:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 21:40:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:40:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:40:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:40:54,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:40:54,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625634755] [2025-02-05 21:40:54,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625634755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:40:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:40:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 21:40:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729374666] [2025-02-05 21:40:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:40:54,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:40:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:40:54,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:40:54,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:40:54,009 INFO L87 Difference]: Start difference. First operand 13920 states and 23151 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-02-05 21:40:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:40:58,771 INFO L93 Difference]: Finished difference Result 34098 states and 56387 transitions. [2025-02-05 21:40:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 21:40:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) Word has length 442 [2025-02-05 21:40:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:40:58,837 INFO L225 Difference]: With dead ends: 34098 [2025-02-05 21:40:58,837 INFO L226 Difference]: Without dead ends: 29662 [2025-02-05 21:40:58,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2025-02-05 21:40:58,858 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 3288 mSDsluCounter, 1896 mSDsCounter, 0 mSdLazyCounter, 2252 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3288 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 2252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:40:58,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3288 Valid, 2434 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 2252 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 21:40:58,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29662 states. [2025-02-05 21:40:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29662 to 16728. [2025-02-05 21:40:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16728 states, 14016 states have (on average 1.6113727168949772) internal successors, (22585), 14108 states have internal predecessors, (22585), 2529 states have call successors, (2529), 182 states have call predecessors, (2529), 182 states have return successors, (2529), 2437 states have call predecessors, (2529), 2529 states have call successors, (2529) [2025-02-05 21:41:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16728 states to 16728 states and 27643 transitions. [2025-02-05 21:41:00,037 INFO L78 Accepts]: Start accepts. Automaton has 16728 states and 27643 transitions. Word has length 442 [2025-02-05 21:41:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 16728 states and 27643 transitions. [2025-02-05 21:41:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 3 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 3 states have call predecessors, (69), 3 states have call successors, (69) [2025-02-05 21:41:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 16728 states and 27643 transitions. [2025-02-05 21:41:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 21:41:00,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:00,050 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:00,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:41:00,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:00,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1868057002, now seen corresponding path program 1 times [2025-02-05 21:41:00,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:00,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903951168] [2025-02-05 21:41:00,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:00,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 21:41:00,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 21:41:00,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:00,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:41:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:09,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903951168] [2025-02-05 21:41:09,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903951168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:09,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:09,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:41:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038913820] [2025-02-05 21:41:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:09,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:41:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:09,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:41:09,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:41:09,044 INFO L87 Difference]: Start difference. First operand 16728 states and 27643 transitions. Second operand has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:15,293 INFO L93 Difference]: Finished difference Result 34096 states and 55070 transitions. [2025-02-05 21:41:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:41:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 442 [2025-02-05 21:41:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:15,395 INFO L225 Difference]: With dead ends: 34096 [2025-02-05 21:41:15,398 INFO L226 Difference]: Without dead ends: 22400 [2025-02-05 21:41:15,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=221, Invalid=649, Unknown=0, NotChecked=0, Total=870 [2025-02-05 21:41:15,447 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 500 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:15,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2808 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 21:41:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22400 states. [2025-02-05 21:41:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22400 to 18264. [2025-02-05 21:41:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18264 states, 15552 states have (on average 1.5880272633744856) internal successors, (24697), 15644 states have internal predecessors, (24697), 2529 states have call successors, (2529), 182 states have call predecessors, (2529), 182 states have return successors, (2529), 2437 states have call predecessors, (2529), 2529 states have call successors, (2529) [2025-02-05 21:41:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18264 states to 18264 states and 29755 transitions. [2025-02-05 21:41:17,057 INFO L78 Accepts]: Start accepts. Automaton has 18264 states and 29755 transitions. Word has length 442 [2025-02-05 21:41:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:17,058 INFO L471 AbstractCegarLoop]: Abstraction has 18264 states and 29755 transitions. [2025-02-05 21:41:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.666666666666667) internal successors, (100), 15 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18264 states and 29755 transitions. [2025-02-05 21:41:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-05 21:41:17,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:17,071 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:17,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:41:17,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:17,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:17,072 INFO L85 PathProgramCache]: Analyzing trace with hash 71105643, now seen corresponding path program 1 times [2025-02-05 21:41:17,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:17,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868542537] [2025-02-05 21:41:17,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:17,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-05 21:41:17,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-05 21:41:17,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:17,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:41:17,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868542537] [2025-02-05 21:41:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868542537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:17,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187387642] [2025-02-05 21:41:17,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:17,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:17,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:17,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:17,157 INFO L87 Difference]: Start difference. First operand 18264 states and 29755 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:19,537 INFO L93 Difference]: Finished difference Result 41560 states and 67705 transitions. [2025-02-05 21:41:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 442 [2025-02-05 21:41:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:19,607 INFO L225 Difference]: With dead ends: 41560 [2025-02-05 21:41:19,607 INFO L226 Difference]: Without dead ends: 29864 [2025-02-05 21:41:19,629 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 21:41:19,630 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 353 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:19,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 704 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29864 states. [2025-02-05 21:41:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29864 to 29862. [2025-02-05 21:41:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29862 states, 24514 states have (on average 1.5651056539120503) internal successors, (38367), 24698 states have internal predecessors, (38367), 4989 states have call successors, (4989), 358 states have call predecessors, (4989), 358 states have return successors, (4989), 4805 states have call predecessors, (4989), 4989 states have call successors, (4989) [2025-02-05 21:41:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29862 states to 29862 states and 48345 transitions. [2025-02-05 21:41:22,542 INFO L78 Accepts]: Start accepts. Automaton has 29862 states and 48345 transitions. Word has length 442 [2025-02-05 21:41:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 29862 states and 48345 transitions. [2025-02-05 21:41:22,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29862 states and 48345 transitions. [2025-02-05 21:41:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:41:22,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:22,554 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:22,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:41:22,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:22,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash 333195321, now seen corresponding path program 1 times [2025-02-05 21:41:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608545490] [2025-02-05 21:41:22,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:22,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:41:22,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:41:22,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:22,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:41:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608545490] [2025-02-05 21:41:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608545490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:41:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774545611] [2025-02-05 21:41:22,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:22,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:41:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:22,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:41:22,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:41:22,758 INFO L87 Difference]: Start difference. First operand 29862 states and 48345 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:26,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:26,460 INFO L93 Difference]: Finished difference Result 67350 states and 108438 transitions. [2025-02-05 21:41:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:41:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-02-05 21:41:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:26,572 INFO L225 Difference]: With dead ends: 67350 [2025-02-05 21:41:26,572 INFO L226 Difference]: Without dead ends: 44056 [2025-02-05 21:41:26,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:41:26,613 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 360 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:26,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1057 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:41:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44056 states. [2025-02-05 21:41:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44056 to 41652. [2025-02-05 21:41:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41652 states, 33668 states have (on average 1.5541463704407745) internal successors, (52325), 33944 states have internal predecessors, (52325), 7449 states have call successors, (7449), 534 states have call predecessors, (7449), 534 states have return successors, (7449), 7173 states have call predecessors, (7449), 7449 states have call successors, (7449) [2025-02-05 21:41:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41652 states to 41652 states and 67223 transitions. [2025-02-05 21:41:30,372 INFO L78 Accepts]: Start accepts. Automaton has 41652 states and 67223 transitions. Word has length 443 [2025-02-05 21:41:30,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:30,372 INFO L471 AbstractCegarLoop]: Abstraction has 41652 states and 67223 transitions. [2025-02-05 21:41:30,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 41652 states and 67223 transitions. [2025-02-05 21:41:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:41:30,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:30,384 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:30,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:41:30,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:30,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:30,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2131979046, now seen corresponding path program 1 times [2025-02-05 21:41:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:30,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723274486] [2025-02-05 21:41:30,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:30,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:41:30,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:41:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:41:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723274486] [2025-02-05 21:41:35,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723274486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:35,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:35,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:41:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885571343] [2025-02-05 21:41:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:35,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:41:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:35,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:41:35,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:41:35,370 INFO L87 Difference]: Start difference. First operand 41652 states and 67223 transitions. Second operand has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:42,934 INFO L93 Difference]: Finished difference Result 45788 states and 72507 transitions. [2025-02-05 21:41:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:41:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-02-05 21:41:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:43,023 INFO L225 Difference]: With dead ends: 45788 [2025-02-05 21:41:43,023 INFO L226 Difference]: Without dead ends: 45786 [2025-02-05 21:41:43,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:41:43,037 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 675 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:43,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 2298 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 21:41:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45786 states. [2025-02-05 21:41:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45786 to 41748. [2025-02-05 21:41:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41748 states, 33764 states have (on average 1.5525707854519606) internal successors, (52421), 34040 states have internal predecessors, (52421), 7449 states have call successors, (7449), 534 states have call predecessors, (7449), 534 states have return successors, (7449), 7173 states have call predecessors, (7449), 7449 states have call successors, (7449) [2025-02-05 21:41:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41748 states to 41748 states and 67319 transitions. [2025-02-05 21:41:46,286 INFO L78 Accepts]: Start accepts. Automaton has 41748 states and 67319 transitions. Word has length 443 [2025-02-05 21:41:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:46,286 INFO L471 AbstractCegarLoop]: Abstraction has 41748 states and 67319 transitions. [2025-02-05 21:41:46,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.3125) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 41748 states and 67319 transitions. [2025-02-05 21:41:46,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:41:46,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:46,297 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:46,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:41:46,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:46,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 604197655, now seen corresponding path program 1 times [2025-02-05 21:41:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791317849] [2025-02-05 21:41:46,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:46,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:41:46,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:41:46,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:46,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:41:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9384 trivial. 0 not checked. [2025-02-05 21:41:46,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:41:46,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791317849] [2025-02-05 21:41:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791317849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:41:46,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:41:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:41:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741348413] [2025-02-05 21:41:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:41:46,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:41:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:41:46,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:41:46,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:41:46,463 INFO L87 Difference]: Start difference. First operand 41748 states and 67319 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:41:49,685 INFO L93 Difference]: Finished difference Result 78272 states and 125778 transitions. [2025-02-05 21:41:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:41:49,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) Word has length 443 [2025-02-05 21:41:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:41:49,786 INFO L225 Difference]: With dead ends: 78272 [2025-02-05 21:41:49,786 INFO L226 Difference]: Without dead ends: 42900 [2025-02-05 21:41:49,845 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 21:41:49,845 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 6 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:41:49,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 692 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:41:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42900 states. [2025-02-05 21:41:53,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42900 to 41748. [2025-02-05 21:41:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41748 states, 33764 states have (on average 1.5411977253879872) internal successors, (52037), 34040 states have internal predecessors, (52037), 7449 states have call successors, (7449), 534 states have call predecessors, (7449), 534 states have return successors, (7449), 7173 states have call predecessors, (7449), 7449 states have call successors, (7449) [2025-02-05 21:41:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41748 states to 41748 states and 66935 transitions. [2025-02-05 21:41:53,948 INFO L78 Accepts]: Start accepts. Automaton has 41748 states and 66935 transitions. Word has length 443 [2025-02-05 21:41:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:41:53,948 INFO L471 AbstractCegarLoop]: Abstraction has 41748 states and 66935 transitions. [2025-02-05 21:41:53,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (69), 1 states have call predecessors, (69), 1 states have return successors, (69), 1 states have call predecessors, (69), 1 states have call successors, (69) [2025-02-05 21:41:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 41748 states and 66935 transitions. [2025-02-05 21:41:53,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-05 21:41:53,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:41:53,962 INFO L218 NwaCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:53,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:41:53,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:41:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:41:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1491701336, now seen corresponding path program 1 times [2025-02-05 21:41:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:41:53,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415791998] [2025-02-05 21:41:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:41:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:41:53,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-05 21:41:54,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-05 21:41:54,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:41:54,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat