./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-26.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-500_file-26.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 2e667493c61c3f8002b3fd47b244ecacaeeb86310cf93e50fd4a8ca6ac8d2b98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:08,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:08,539 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:56:08,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:08,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:08,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:08,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:08,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:08,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:08,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:08,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:08,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:08,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:08,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:08,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:08,564 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:08,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:08,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:08,565 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 -> 2e667493c61c3f8002b3fd47b244ecacaeeb86310cf93e50fd4a8ca6ac8d2b98 [2025-02-05 21:56:08,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:56:08,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:56:08,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:56:08,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:56:08,796 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:56:08,796 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-500_file-26.i [2025-02-05 21:56:09,920 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4407827be/e411d29c1ab848dfa16d6ff0dd65c077/FLAGb1cfea293 [2025-02-05 21:56:10,204 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:56:10,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-26.i [2025-02-05 21:56:10,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4407827be/e411d29c1ab848dfa16d6ff0dd65c077/FLAGb1cfea293 [2025-02-05 21:56:10,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4407827be/e411d29c1ab848dfa16d6ff0dd65c077 [2025-02-05 21:56:10,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:10,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:10,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:10,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:10,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:10,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdd69cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10, skipping insertion in model container [2025-02-05 21:56:10,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:10,371 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-500_file-26.i[916,929] [2025-02-05 21:56:10,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:10,546 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:10,555 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-500_file-26.i[916,929] [2025-02-05 21:56:10,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:10,654 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:10,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10 WrapperNode [2025-02-05 21:56:10,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:10,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:10,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:10,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:10,661 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:56:10" (1/1) ... [2025-02-05 21:56:10,676 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:56:10" (1/1) ... [2025-02-05 21:56:10,739 INFO L138 Inliner]: procedures = 26, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 811 [2025-02-05 21:56:10,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:10,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:10,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:10,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:10,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,787 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:56:10,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:10,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:10,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:10,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:10,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (1/1) ... [2025-02-05 21:56:10,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:10,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:10,867 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:56:10,872 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:56:10,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:10,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:10,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:11,010 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:11,012 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:11,959 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:11,960 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:11,992 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:11,992 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 21:56:11,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:11 BoogieIcfgContainer [2025-02-05 21:56:11,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:11,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:11,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:12,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:12,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:10" (1/3) ... [2025-02-05 21:56:12,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e71b20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:12, skipping insertion in model container [2025-02-05 21:56:12,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:10" (2/3) ... [2025-02-05 21:56:12,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e71b20f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:12, skipping insertion in model container [2025-02-05 21:56:12,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:11" (3/3) ... [2025-02-05 21:56:12,005 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-26.i [2025-02-05 21:56:12,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:12,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-26.i that has 2 procedures, 331 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:12,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:12,092 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;@104796da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:12,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:12,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 228 states have internal predecessors, (359), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 21:56:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-02-05 21:56:12,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:12,123 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 785136504, now seen corresponding path program 1 times [2025-02-05 21:56:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118852239] [2025-02-05 21:56:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:12,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-02-05 21:56:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-02-05 21:56:12,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:12,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-02-05 21:56:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118852239] [2025-02-05 21:56:12,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118852239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172339293] [2025-02-05 21:56:12,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:12,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:12,720 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:56:12,727 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:56:12,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-02-05 21:56:13,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-02-05 21:56:13,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:13,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:13,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:13,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-02-05 21:56:13,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172339293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:13,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322271268] [2025-02-05 21:56:13,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:13,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:13,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:13,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:13,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:13,226 INFO L87 Difference]: Start difference. First operand has 331 states, 227 states have (on average 1.5814977973568283) internal successors, (359), 228 states have internal predecessors, (359), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) Second operand has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:56:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:13,307 INFO L93 Difference]: Finished difference Result 656 states and 1218 transitions. [2025-02-05 21:56:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:13,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) Word has length 647 [2025-02-05 21:56:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:13,322 INFO L225 Difference]: With dead ends: 656 [2025-02-05 21:56:13,322 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 21:56:13,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 648 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:56:13,332 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:13,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 539 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 21:56:13,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-05 21:56:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 225 states have (on average 1.568888888888889) internal successors, (353), 225 states have internal predecessors, (353), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 21:56:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 555 transitions. [2025-02-05 21:56:13,415 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 555 transitions. Word has length 647 [2025-02-05 21:56:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:13,417 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 555 transitions. [2025-02-05 21:56:13,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 73.5) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:56:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 555 transitions. [2025-02-05 21:56:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2025-02-05 21:56:13,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:13,430 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:56:13,631 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:56:13,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:13,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -263842571, now seen corresponding path program 1 times [2025-02-05 21:56:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69573045] [2025-02-05 21:56:13,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:13,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 647 statements into 1 equivalence classes. [2025-02-05 21:56:13,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 647 of 647 statements. [2025-02-05 21:56:13,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:13,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:14,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:14,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69573045] [2025-02-05 21:56:14,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69573045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:14,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:14,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665056789] [2025-02-05 21:56:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:14,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:14,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:14,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:14,318 INFO L87 Difference]: Start difference. First operand 328 states and 555 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:14,457 INFO L93 Difference]: Finished difference Result 839 states and 1427 transitions. [2025-02-05 21:56:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:14,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 647 [2025-02-05 21:56:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:14,467 INFO L225 Difference]: With dead ends: 839 [2025-02-05 21:56:14,467 INFO L226 Difference]: Without dead ends: 514 [2025-02-05 21:56:14,469 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:56:14,469 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 320 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:14,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1029 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-02-05 21:56:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 511. [2025-02-05 21:56:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 375 states have (on average 1.592) internal successors, (597), 376 states have internal predecessors, (597), 133 states have call successors, (133), 2 states have call predecessors, (133), 2 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-05 21:56:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 863 transitions. [2025-02-05 21:56:14,540 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 863 transitions. Word has length 647 [2025-02-05 21:56:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:14,541 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 863 transitions. [2025-02-05 21:56:14,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 863 transitions. [2025-02-05 21:56:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 21:56:14,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:14,548 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:14,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:14,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash -144351439, now seen corresponding path program 1 times [2025-02-05 21:56:14,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803358148] [2025-02-05 21:56:14,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 21:56:14,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 21:56:14,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:14,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:14,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:14,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803358148] [2025-02-05 21:56:14,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803358148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:14,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414074612] [2025-02-05 21:56:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:14,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:14,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:14,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:14,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:14,892 INFO L87 Difference]: Start difference. First operand 511 states and 863 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:15,022 INFO L93 Difference]: Finished difference Result 1527 states and 2583 transitions. [2025-02-05 21:56:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:15,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 648 [2025-02-05 21:56:15,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:15,037 INFO L225 Difference]: With dead ends: 1527 [2025-02-05 21:56:15,037 INFO L226 Difference]: Without dead ends: 1019 [2025-02-05 21:56:15,039 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:56:15,042 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 543 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:15,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1062 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-02-05 21:56:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2025-02-05 21:56:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 746 states have (on average 1.584450402144772) internal successors, (1182), 748 states have internal predecessors, (1182), 266 states have call successors, (266), 4 states have call predecessors, (266), 4 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-02-05 21:56:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1714 transitions. [2025-02-05 21:56:15,213 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1714 transitions. Word has length 648 [2025-02-05 21:56:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1714 transitions. [2025-02-05 21:56:15,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1714 transitions. [2025-02-05 21:56:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 21:56:15,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:15,221 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:15,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:15,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:15,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -355702352, now seen corresponding path program 1 times [2025-02-05 21:56:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834492951] [2025-02-05 21:56:15,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:15,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 21:56:15,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 21:56:15,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:15,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:15,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834492951] [2025-02-05 21:56:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834492951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961897495] [2025-02-05 21:56:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:15,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:15,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:15,904 INFO L87 Difference]: Start difference. First operand 1017 states and 1714 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:16,839 INFO L93 Difference]: Finished difference Result 5290 states and 8889 transitions. [2025-02-05 21:56:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:56:16,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 648 [2025-02-05 21:56:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:16,867 INFO L225 Difference]: With dead ends: 5290 [2025-02-05 21:56:16,868 INFO L226 Difference]: Without dead ends: 4276 [2025-02-05 21:56:16,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:56:16,875 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 1842 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1842 SdHoareTripleChecker+Valid, 2720 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:16,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1842 Valid, 2720 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:56:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-02-05 21:56:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4249. [2025-02-05 21:56:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 3222 states have (on average 1.5927995034140285) internal successors, (5132), 3245 states have internal predecessors, (5132), 999 states have call successors, (999), 27 states have call predecessors, (999), 27 states have return successors, (999), 976 states have call predecessors, (999), 999 states have call successors, (999) [2025-02-05 21:56:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 7130 transitions. [2025-02-05 21:56:17,153 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 7130 transitions. Word has length 648 [2025-02-05 21:56:17,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:17,154 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 7130 transitions. [2025-02-05 21:56:17,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:17,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 7130 transitions. [2025-02-05 21:56:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 21:56:17,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:17,161 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:17,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:17,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:17,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash 613878671, now seen corresponding path program 1 times [2025-02-05 21:56:17,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:17,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158180710] [2025-02-05 21:56:17,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:17,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 21:56:17,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 21:56:17,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:17,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158180710] [2025-02-05 21:56:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158180710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:18,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:18,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:56:18,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151448408] [2025-02-05 21:56:18,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:18,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:56:18,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:56:18,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:18,204 INFO L87 Difference]: Start difference. First operand 4249 states and 7130 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:19,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:19,312 INFO L93 Difference]: Finished difference Result 12199 states and 20457 transitions. [2025-02-05 21:56:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:19,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 648 [2025-02-05 21:56:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:19,358 INFO L225 Difference]: With dead ends: 12199 [2025-02-05 21:56:19,358 INFO L226 Difference]: Without dead ends: 8035 [2025-02-05 21:56:19,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:19,371 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1824 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:19,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 2166 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:56:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8035 states. [2025-02-05 21:56:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8035 to 6217. [2025-02-05 21:56:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6217 states, 4842 states have (on average 1.6047087980173482) internal successors, (7770), 4877 states have internal predecessors, (7770), 1335 states have call successors, (1335), 39 states have call predecessors, (1335), 39 states have return successors, (1335), 1300 states have call predecessors, (1335), 1335 states have call successors, (1335) [2025-02-05 21:56:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 10440 transitions. [2025-02-05 21:56:19,722 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 10440 transitions. Word has length 648 [2025-02-05 21:56:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:19,725 INFO L471 AbstractCegarLoop]: Abstraction has 6217 states and 10440 transitions. [2025-02-05 21:56:19,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 10440 transitions. [2025-02-05 21:56:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2025-02-05 21:56:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:19,736 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:19,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1193968850, now seen corresponding path program 1 times [2025-02-05 21:56:19,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:19,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069695243] [2025-02-05 21:56:19,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:19,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:19,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 648 statements into 1 equivalence classes. [2025-02-05 21:56:20,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 648 of 648 statements. [2025-02-05 21:56:20,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:20,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:21,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:21,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069695243] [2025-02-05 21:56:21,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069695243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:21,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:21,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:21,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924994008] [2025-02-05 21:56:21,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:21,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:21,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:21,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:21,444 INFO L87 Difference]: Start difference. First operand 6217 states and 10440 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:56:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:23,980 INFO L93 Difference]: Finished difference Result 32011 states and 53509 transitions. [2025-02-05 21:56:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 21:56:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) Word has length 648 [2025-02-05 21:56:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:24,097 INFO L225 Difference]: With dead ends: 32011 [2025-02-05 21:56:24,097 INFO L226 Difference]: Without dead ends: 25879 [2025-02-05 21:56:24,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:56:24,128 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 2533 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:24,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 2928 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:56:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25879 states. [2025-02-05 21:56:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25879 to 10539. [2025-02-05 21:56:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10539 states, 8253 states have (on average 1.6087483339391737) internal successors, (13277), 8306 states have internal predecessors, (13277), 2177 states have call successors, (2177), 108 states have call predecessors, (2177), 108 states have return successors, (2177), 2124 states have call predecessors, (2177), 2177 states have call successors, (2177) [2025-02-05 21:56:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10539 states to 10539 states and 17631 transitions. [2025-02-05 21:56:25,107 INFO L78 Accepts]: Start accepts. Automaton has 10539 states and 17631 transitions. Word has length 648 [2025-02-05 21:56:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:25,109 INFO L471 AbstractCegarLoop]: Abstraction has 10539 states and 17631 transitions. [2025-02-05 21:56:25,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) [2025-02-05 21:56:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10539 states and 17631 transitions. [2025-02-05 21:56:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:25,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:25,119 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:25,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:25,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -939034318, now seen corresponding path program 1 times [2025-02-05 21:56:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606387541] [2025-02-05 21:56:25,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:25,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:25,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:25,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:25,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:25,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606387541] [2025-02-05 21:56:25,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606387541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:25,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:25,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589180278] [2025-02-05 21:56:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:25,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:25,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:25,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:25,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:25,278 INFO L87 Difference]: Start difference. First operand 10539 states and 17631 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:26,048 INFO L93 Difference]: Finished difference Result 30339 states and 50744 transitions. [2025-02-05 21:56:26,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:26,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 649 [2025-02-05 21:56:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:26,122 INFO L225 Difference]: With dead ends: 30339 [2025-02-05 21:56:26,122 INFO L226 Difference]: Without dead ends: 19889 [2025-02-05 21:56:26,154 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:56:26,154 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 356 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:26,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1072 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19889 states. [2025-02-05 21:56:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19889 to 18719. [2025-02-05 21:56:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18719 states, 14788 states have (on average 1.5939951311874492) internal successors, (23572), 14889 states have internal predecessors, (23572), 3725 states have call successors, (3725), 205 states have call predecessors, (3725), 205 states have return successors, (3725), 3624 states have call predecessors, (3725), 3725 states have call successors, (3725) [2025-02-05 21:56:27,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18719 states to 18719 states and 31022 transitions. [2025-02-05 21:56:27,443 INFO L78 Accepts]: Start accepts. Automaton has 18719 states and 31022 transitions. Word has length 649 [2025-02-05 21:56:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:27,444 INFO L471 AbstractCegarLoop]: Abstraction has 18719 states and 31022 transitions. [2025-02-05 21:56:27,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 18719 states and 31022 transitions. [2025-02-05 21:56:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:27,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:27,465 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:27,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:27,466 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:27,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash 169780881, now seen corresponding path program 1 times [2025-02-05 21:56:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:27,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791046501] [2025-02-05 21:56:27,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:27,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:27,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:27,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791046501] [2025-02-05 21:56:27,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791046501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:27,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:27,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407935318] [2025-02-05 21:56:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:27,653 INFO L87 Difference]: Start difference. First operand 18719 states and 31022 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:28,433 INFO L93 Difference]: Finished difference Result 37499 states and 62088 transitions. [2025-02-05 21:56:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:28,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 649 [2025-02-05 21:56:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:28,513 INFO L225 Difference]: With dead ends: 37499 [2025-02-05 21:56:28,514 INFO L226 Difference]: Without dead ends: 18873 [2025-02-05 21:56:28,555 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:56:28,556 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 348 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:28,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1307 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18873 states. [2025-02-05 21:56:29,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18873 to 13651. [2025-02-05 21:56:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13651 states, 11576 states have (on average 1.6212854181064271) internal successors, (18768), 11621 states have internal predecessors, (18768), 1953 states have call successors, (1953), 121 states have call predecessors, (1953), 121 states have return successors, (1953), 1908 states have call predecessors, (1953), 1953 states have call successors, (1953) [2025-02-05 21:56:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13651 states to 13651 states and 22674 transitions. [2025-02-05 21:56:29,201 INFO L78 Accepts]: Start accepts. Automaton has 13651 states and 22674 transitions. Word has length 649 [2025-02-05 21:56:29,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:29,202 INFO L471 AbstractCegarLoop]: Abstraction has 13651 states and 22674 transitions. [2025-02-05 21:56:29,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 13651 states and 22674 transitions. [2025-02-05 21:56:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:29,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:29,215 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:29,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:29,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1295627052, now seen corresponding path program 1 times [2025-02-05 21:56:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534516308] [2025-02-05 21:56:29,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:29,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:29,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:29,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:29,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:29,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534516308] [2025-02-05 21:56:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534516308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114103188] [2025-02-05 21:56:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:29,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:29,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:29,389 INFO L87 Difference]: Start difference. First operand 13651 states and 22674 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:29,909 INFO L93 Difference]: Finished difference Result 25803 states and 42836 transitions. [2025-02-05 21:56:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 649 [2025-02-05 21:56:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:29,951 INFO L225 Difference]: With dead ends: 25803 [2025-02-05 21:56:29,951 INFO L226 Difference]: Without dead ends: 12245 [2025-02-05 21:56:29,971 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:56:29,972 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 319 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:29,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1308 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12245 states. [2025-02-05 21:56:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12245 to 11019. [2025-02-05 21:56:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11019 states, 9444 states have (on average 1.6175349428208385) internal successors, (15276), 9473 states have internal predecessors, (15276), 1465 states have call successors, (1465), 109 states have call predecessors, (1465), 109 states have return successors, (1465), 1436 states have call predecessors, (1465), 1465 states have call successors, (1465) [2025-02-05 21:56:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 18206 transitions. [2025-02-05 21:56:30,356 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 18206 transitions. Word has length 649 [2025-02-05 21:56:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:30,357 INFO L471 AbstractCegarLoop]: Abstraction has 11019 states and 18206 transitions. [2025-02-05 21:56:30,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 18206 transitions. [2025-02-05 21:56:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-02-05 21:56:30,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:30,366 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:30,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:30,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:30,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:30,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1563628495, now seen corresponding path program 1 times [2025-02-05 21:56:30,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242472786] [2025-02-05 21:56:30,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:30,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-02-05 21:56:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-02-05 21:56:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:30,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:31,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:31,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242472786] [2025-02-05 21:56:31,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242472786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:31,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387096027] [2025-02-05 21:56:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:31,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:31,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:31,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:31,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:31,042 INFO L87 Difference]: Start difference. First operand 11019 states and 18206 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:31,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:31,646 INFO L93 Difference]: Finished difference Result 22747 states and 37432 transitions. [2025-02-05 21:56:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:31,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 649 [2025-02-05 21:56:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:31,693 INFO L225 Difference]: With dead ends: 22747 [2025-02-05 21:56:31,694 INFO L226 Difference]: Without dead ends: 11821 [2025-02-05 21:56:31,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:31,717 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 34 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:31,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1614 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11821 states. [2025-02-05 21:56:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11821 to 11787. [2025-02-05 21:56:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11787 states, 10084 states have (on average 1.603728679095597) internal successors, (16172), 10145 states have internal predecessors, (16172), 1561 states have call successors, (1561), 141 states have call predecessors, (1561), 141 states have return successors, (1561), 1500 states have call predecessors, (1561), 1561 states have call successors, (1561) [2025-02-05 21:56:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 19294 transitions. [2025-02-05 21:56:32,413 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 19294 transitions. Word has length 649 [2025-02-05 21:56:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:32,414 INFO L471 AbstractCegarLoop]: Abstraction has 11787 states and 19294 transitions. [2025-02-05 21:56:32,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 19294 transitions. [2025-02-05 21:56:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:32,427 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:56:32,427 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 230050876, now seen corresponding path program 1 times [2025-02-05 21:56:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131716992] [2025-02-05 21:56:32,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:32,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:32,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:32,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:32,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:33,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:33,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131716992] [2025-02-05 21:56:33,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131716992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:33,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:33,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112284232] [2025-02-05 21:56:33,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:33,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:33,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:33,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:33,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:33,326 INFO L87 Difference]: Start difference. First operand 11787 states and 19294 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:34,319 INFO L93 Difference]: Finished difference Result 29076 states and 47714 transitions. [2025-02-05 21:56:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:34,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:56:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:34,370 INFO L225 Difference]: With dead ends: 29076 [2025-02-05 21:56:34,371 INFO L226 Difference]: Without dead ends: 17382 [2025-02-05 21:56:34,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:56:34,391 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 568 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:34,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1924 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17382 states. [2025-02-05 21:56:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17382 to 16260. [2025-02-05 21:56:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16260 states, 14499 states have (on average 1.6203876129388233) internal successors, (23494), 14559 states have internal predecessors, (23494), 1617 states have call successors, (1617), 143 states have call predecessors, (1617), 143 states have return successors, (1617), 1557 states have call predecessors, (1617), 1617 states have call successors, (1617) [2025-02-05 21:56:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 26728 transitions. [2025-02-05 21:56:34,864 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 26728 transitions. Word has length 650 [2025-02-05 21:56:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:34,865 INFO L471 AbstractCegarLoop]: Abstraction has 16260 states and 26728 transitions. [2025-02-05 21:56:34,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 26728 transitions. [2025-02-05 21:56:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:34,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:34,874 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:56:34,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:34,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1566900483, now seen corresponding path program 1 times [2025-02-05 21:56:34,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:34,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290212485] [2025-02-05 21:56:34,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:34,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:35,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:35,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:35,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:37,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290212485] [2025-02-05 21:56:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290212485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:37,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:56:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359234119] [2025-02-05 21:56:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:37,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:56:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:37,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:56:37,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:56:37,374 INFO L87 Difference]: Start difference. First operand 16260 states and 26728 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:48,311 INFO L93 Difference]: Finished difference Result 233904 states and 382018 transitions. [2025-02-05 21:56:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 21:56:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:56:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:48,879 INFO L225 Difference]: With dead ends: 233904 [2025-02-05 21:56:48,880 INFO L226 Difference]: Without dead ends: 220094 [2025-02-05 21:56:49,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:56:49,042 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 4924 mSDsluCounter, 7715 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 817 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4924 SdHoareTripleChecker+Valid, 9081 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 817 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:49,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4924 Valid, 9081 Invalid, 3146 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [817 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 21:56:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220094 states. [2025-02-05 21:56:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220094 to 68922. [2025-02-05 21:56:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68922 states, 61309 states have (on average 1.6180006198111208) internal successors, (99198), 61621 states have internal predecessors, (99198), 6929 states have call successors, (6929), 683 states have call predecessors, (6929), 683 states have return successors, (6929), 6617 states have call predecessors, (6929), 6929 states have call successors, (6929) [2025-02-05 21:56:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68922 states to 68922 states and 113056 transitions. [2025-02-05 21:56:53,125 INFO L78 Accepts]: Start accepts. Automaton has 68922 states and 113056 transitions. Word has length 650 [2025-02-05 21:56:53,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 68922 states and 113056 transitions. [2025-02-05 21:56:53,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 68922 states and 113056 transitions. [2025-02-05 21:56:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:56:53,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:53,151 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:56:53,151 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1501253635, now seen corresponding path program 1 times [2025-02-05 21:56:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481675185] [2025-02-05 21:56:53,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:53,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:56:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:56:53,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:56:53,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:53,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481675185] [2025-02-05 21:56:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481675185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:53,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:56:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619278105] [2025-02-05 21:56:53,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:56:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:53,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:56:53,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:56:53,765 INFO L87 Difference]: Start difference. First operand 68922 states and 113056 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:56:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:59,632 INFO L93 Difference]: Finished difference Result 167619 states and 273142 transitions. [2025-02-05 21:56:59,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:59,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 650 [2025-02-05 21:56:59,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:59,956 INFO L225 Difference]: With dead ends: 167619 [2025-02-05 21:56:59,956 INFO L226 Difference]: Without dead ends: 109900 [2025-02-05 21:57:00,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:57:00,058 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1566 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:00,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 2446 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:57:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109900 states. [2025-02-05 21:57:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109900 to 68535. [2025-02-05 21:57:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68535 states, 60922 states have (on average 1.61660812186074) internal successors, (98487), 61234 states have internal predecessors, (98487), 6929 states have call successors, (6929), 683 states have call predecessors, (6929), 683 states have return successors, (6929), 6617 states have call predecessors, (6929), 6929 states have call successors, (6929) [2025-02-05 21:57:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68535 states to 68535 states and 112345 transitions. [2025-02-05 21:57:03,947 INFO L78 Accepts]: Start accepts. Automaton has 68535 states and 112345 transitions. Word has length 650 [2025-02-05 21:57:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:03,948 INFO L471 AbstractCegarLoop]: Abstraction has 68535 states and 112345 transitions. [2025-02-05 21:57:03,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-02-05 21:57:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 68535 states and 112345 transitions. [2025-02-05 21:57:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-02-05 21:57:03,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:03,972 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:03,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:57:03,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:03,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash 619033564, now seen corresponding path program 1 times [2025-02-05 21:57:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:03,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516964799] [2025-02-05 21:57:03,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:04,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-02-05 21:57:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-02-05 21:57:04,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:04,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-02-05 21:57:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:08,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516964799] [2025-02-05 21:57:08,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516964799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:08,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:57:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506697632] [2025-02-05 21:57:08,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:08,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:57:08,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:08,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:57:08,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:57:08,018 INFO L87 Difference]: Start difference. First operand 68535 states and 112345 transitions. Second operand has 10 states, 10 states have (on average 14.8) internal successors, (148), 10 states have internal predecessors, (148), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101)