./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-14.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-14.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 6a5b8f8985922577fd511c19d4504abdec5cee4f39c0b7323776313784fc34a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:55:18,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:55:18,166 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:55:18,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:55:18,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:55:18,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:55:18,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:55:18,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:55:18,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:55:18,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:55:18,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:55:18,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:55:18,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:55:18,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:55:18,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:55:18,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:55:18,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:18,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:55:18,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:55:18,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:55:18,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:55:18,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:55:18,204 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 -> 6a5b8f8985922577fd511c19d4504abdec5cee4f39c0b7323776313784fc34a5 [2025-02-05 21:55:18,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:55:18,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:55:18,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:55:18,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:55:18,394 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:55:18,395 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-14.i [2025-02-05 21:55:19,603 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca3228ab/ea596c63c74646658b7f19f2e8fa6bdf/FLAG759319a8f [2025-02-05 21:55:19,957 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:55:19,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-14.i [2025-02-05 21:55:19,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca3228ab/ea596c63c74646658b7f19f2e8fa6bdf/FLAG759319a8f [2025-02-05 21:55:20,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca3228ab/ea596c63c74646658b7f19f2e8fa6bdf [2025-02-05 21:55:20,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:55:20,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:55:20,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:20,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:55:20,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:55:20,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b0f67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20, skipping insertion in model container [2025-02-05 21:55:20,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:55:20,313 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-14.i[916,929] [2025-02-05 21:55:20,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:20,454 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:55:20,468 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-14.i[916,929] [2025-02-05 21:55:20,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:55:20,547 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:55:20,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20 WrapperNode [2025-02-05 21:55:20,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:55:20,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:20,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:55:20,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:55:20,553 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:55:20" (1/1) ... [2025-02-05 21:55:20,568 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:55:20" (1/1) ... [2025-02-05 21:55:20,647 INFO L138 Inliner]: procedures = 26, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 868 [2025-02-05 21:55:20,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:55:20,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:55:20,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:55:20,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:55:20,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,711 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:55:20,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:55:20,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:55:20,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:55:20,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:55:20,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (1/1) ... [2025-02-05 21:55:20,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:55:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:20,804 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:55:20,827 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:55:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:55:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:55:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:55:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:55:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:55:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:55:20,968 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:55:20,970 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:55:21,836 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:55:21,837 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:55:21,864 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:55:21,866 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:55:21,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:21 BoogieIcfgContainer [2025-02-05 21:55:21,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:55:21,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:55:21,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:55:21,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:55:21,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:55:20" (1/3) ... [2025-02-05 21:55:21,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bda5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:21, skipping insertion in model container [2025-02-05 21:55:21,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:55:20" (2/3) ... [2025-02-05 21:55:21,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bda5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:55:21, skipping insertion in model container [2025-02-05 21:55:21,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:55:21" (3/3) ... [2025-02-05 21:55:21,874 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-14.i [2025-02-05 21:55:21,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:55:21,887 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-14.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:55:21,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:55:21,946 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;@71b6545e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:55:21,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:55:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 240 states have internal predecessors, (379), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 21:55:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-02-05 21:55:21,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:21,983 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:21,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash 809238924, now seen corresponding path program 1 times [2025-02-05 21:55:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:21,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703341885] [2025-02-05 21:55:21,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:22,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-02-05 21:55:22,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-02-05 21:55:22,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:22,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2025-02-05 21:55:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703341885] [2025-02-05 21:55:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703341885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:55:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397935552] [2025-02-05 21:55:22,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:55:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:55:22,575 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:55:22,577 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:55:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-02-05 21:55:22,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-02-05 21:55:22,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:22,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:22,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:55:22,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:55:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 31250 trivial. 0 not checked. [2025-02-05 21:55:23,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:55:23,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397935552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:23,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:55:23,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:55:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5070669] [2025-02-05 21:55:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:23,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:55:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:23,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:55:23,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:55:23,113 INFO L87 Difference]: Start difference. First operand has 368 states, 239 states have (on average 1.5857740585774058) internal successors, (379), 240 states have internal predecessors, (379), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) [2025-02-05 21:55:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:23,201 INFO L93 Difference]: Finished difference Result 729 states and 1381 transitions. [2025-02-05 21:55:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:55:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) Word has length 784 [2025-02-05 21:55:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:23,211 INFO L225 Difference]: With dead ends: 729 [2025-02-05 21:55:23,211 INFO L226 Difference]: Without dead ends: 364 [2025-02-05 21:55:23,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 785 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:55:23,220 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:23,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 608 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-05 21:55:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-05 21:55:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 236 states have (on average 1.5593220338983051) internal successors, (368), 236 states have internal predecessors, (368), 126 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-02-05 21:55:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 620 transitions. [2025-02-05 21:55:23,286 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 620 transitions. Word has length 784 [2025-02-05 21:55:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 620 transitions. [2025-02-05 21:55:23,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (126), 2 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 2 states have call successors, (126) [2025-02-05 21:55:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 620 transitions. [2025-02-05 21:55:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:23,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:23,298 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:23,309 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:55:23,503 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:55:23,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:23,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:23,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2053294061, now seen corresponding path program 1 times [2025-02-05 21:55:23,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:23,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744394222] [2025-02-05 21:55:23,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:23,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:23,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:23,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:23,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:24,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:24,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744394222] [2025-02-05 21:55:24,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744394222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:24,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:24,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:24,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703551658] [2025-02-05 21:55:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:24,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:24,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:24,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:24,288 INFO L87 Difference]: Start difference. First operand 364 states and 620 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:24,384 INFO L93 Difference]: Finished difference Result 933 states and 1600 transitions. [2025-02-05 21:55:24,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:24,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:24,390 INFO L225 Difference]: With dead ends: 933 [2025-02-05 21:55:24,391 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 21:55:24,392 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:55:24,392 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 347 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:24,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1299 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 21:55:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2025-02-05 21:55:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 404 states have (on average 1.6212871287128714) internal successors, (655), 405 states have internal predecessors, (655), 162 states have call successors, (162), 2 states have call predecessors, (162), 2 states have return successors, (162), 161 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-05 21:55:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 979 transitions. [2025-02-05 21:55:24,471 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 979 transitions. Word has length 785 [2025-02-05 21:55:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:24,472 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 979 transitions. [2025-02-05 21:55:24,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 979 transitions. [2025-02-05 21:55:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:24,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:24,492 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:55:24,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:24,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1957973964, now seen corresponding path program 1 times [2025-02-05 21:55:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:24,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152518202] [2025-02-05 21:55:24,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:24,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:24,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:24,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:24,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:24,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152518202] [2025-02-05 21:55:24,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152518202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:24,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:24,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170834349] [2025-02-05 21:55:24,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:24,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:24,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:24,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:24,864 INFO L87 Difference]: Start difference. First operand 569 states and 979 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:24,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:24,996 INFO L93 Difference]: Finished difference Result 1559 states and 2694 transitions. [2025-02-05 21:55:24,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:24,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:25,008 INFO L225 Difference]: With dead ends: 1559 [2025-02-05 21:55:25,008 INFO L226 Difference]: Without dead ends: 993 [2025-02-05 21:55:25,011 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:55:25,013 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 367 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:25,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1340 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:55:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-02-05 21:55:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 990. [2025-02-05 21:55:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 740 states have (on average 1.6432432432432433) internal successors, (1216), 743 states have internal predecessors, (1216), 245 states have call successors, (245), 4 states have call predecessors, (245), 4 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-02-05 21:55:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1706 transitions. [2025-02-05 21:55:25,111 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1706 transitions. Word has length 785 [2025-02-05 21:55:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:25,114 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1706 transitions. [2025-02-05 21:55:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1706 transitions. [2025-02-05 21:55:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:25,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:25,122 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:55:25,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash -671404908, now seen corresponding path program 1 times [2025-02-05 21:55:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379074433] [2025-02-05 21:55:25,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:25,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:25,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:25,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:25,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379074433] [2025-02-05 21:55:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379074433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:25,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:25,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:25,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878468920] [2025-02-05 21:55:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:25,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:25,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:25,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:25,369 INFO L87 Difference]: Start difference. First operand 990 states and 1706 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:25,464 INFO L93 Difference]: Finished difference Result 2512 states and 4294 transitions. [2025-02-05 21:55:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:25,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:25,477 INFO L225 Difference]: With dead ends: 2512 [2025-02-05 21:55:25,477 INFO L226 Difference]: Without dead ends: 1525 [2025-02-05 21:55:25,497 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:55:25,498 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 319 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:25,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1205 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2025-02-05 21:55:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1522. [2025-02-05 21:55:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1055 states have (on average 1.5819905213270142) internal successors, (1669), 1062 states have internal predecessors, (1669), 458 states have call successors, (458), 8 states have call predecessors, (458), 8 states have return successors, (458), 451 states have call predecessors, (458), 458 states have call successors, (458) [2025-02-05 21:55:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2585 transitions. [2025-02-05 21:55:25,615 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2585 transitions. Word has length 785 [2025-02-05 21:55:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:25,616 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2585 transitions. [2025-02-05 21:55:25,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2585 transitions. [2025-02-05 21:55:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:25,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:25,628 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:25,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:55:25,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:25,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -926141453, now seen corresponding path program 1 times [2025-02-05 21:55:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229216041] [2025-02-05 21:55:25,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:25,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:25,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229216041] [2025-02-05 21:55:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229216041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:25,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:25,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263474034] [2025-02-05 21:55:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:25,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:25,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:25,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:25,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:25,863 INFO L87 Difference]: Start difference. First operand 1522 states and 2585 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:26,026 INFO L93 Difference]: Finished difference Result 4500 states and 7645 transitions. [2025-02-05 21:55:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:26,040 INFO L225 Difference]: With dead ends: 4500 [2025-02-05 21:55:26,040 INFO L226 Difference]: Without dead ends: 2981 [2025-02-05 21:55:26,044 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:55:26,044 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 588 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:26,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1202 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:26,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-02-05 21:55:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2979. [2025-02-05 21:55:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2046 states have (on average 1.5728250244379276) internal successors, (3218), 2060 states have internal predecessors, (3218), 916 states have call successors, (916), 16 states have call predecessors, (916), 16 states have return successors, (916), 902 states have call predecessors, (916), 916 states have call successors, (916) [2025-02-05 21:55:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 5050 transitions. [2025-02-05 21:55:26,300 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 5050 transitions. Word has length 785 [2025-02-05 21:55:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 5050 transitions. [2025-02-05 21:55:26,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 5050 transitions. [2025-02-05 21:55:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:26,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:26,311 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:55:26,311 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:26,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash -895121646, now seen corresponding path program 1 times [2025-02-05 21:55:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995102519] [2025-02-05 21:55:26,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:26,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:26,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:26,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:26,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995102519] [2025-02-05 21:55:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995102519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:26,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861531441] [2025-02-05 21:55:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:26,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:26,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:26,545 INFO L87 Difference]: Start difference. First operand 2979 states and 5050 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:26,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:26,754 INFO L93 Difference]: Finished difference Result 8305 states and 14034 transitions. [2025-02-05 21:55:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:26,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:26,786 INFO L225 Difference]: With dead ends: 8305 [2025-02-05 21:55:26,786 INFO L226 Difference]: Without dead ends: 5329 [2025-02-05 21:55:26,795 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:55:26,797 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 359 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:26,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1475 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:26,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5329 states. [2025-02-05 21:55:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5329 to 5323. [2025-02-05 21:55:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 3562 states have (on average 1.5468837731611453) internal successors, (5510), 3592 states have internal predecessors, (5510), 1728 states have call successors, (1728), 32 states have call predecessors, (1728), 32 states have return successors, (1728), 1698 states have call predecessors, (1728), 1728 states have call successors, (1728) [2025-02-05 21:55:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 8966 transitions. [2025-02-05 21:55:27,129 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 8966 transitions. Word has length 785 [2025-02-05 21:55:27,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:27,130 INFO L471 AbstractCegarLoop]: Abstraction has 5323 states and 8966 transitions. [2025-02-05 21:55:27,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8966 transitions. [2025-02-05 21:55:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:27,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:27,138 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:55:27,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1303945871, now seen corresponding path program 1 times [2025-02-05 21:55:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504580084] [2025-02-05 21:55:27,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:27,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:27,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:27,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:27,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504580084] [2025-02-05 21:55:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504580084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703925914] [2025-02-05 21:55:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:27,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:27,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:27,354 INFO L87 Difference]: Start difference. First operand 5323 states and 8966 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:27,802 INFO L93 Difference]: Finished difference Result 15963 states and 26892 transitions. [2025-02-05 21:55:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:27,866 INFO L225 Difference]: With dead ends: 15963 [2025-02-05 21:55:27,867 INFO L226 Difference]: Without dead ends: 10643 [2025-02-05 21:55:27,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:27,889 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 598 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:27,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1214 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10643 states. [2025-02-05 21:55:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10643 to 10641. [2025-02-05 21:55:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10641 states, 7120 states have (on average 1.5426966292134832) internal successors, (10984), 7180 states have internal predecessors, (10984), 3456 states have call successors, (3456), 64 states have call predecessors, (3456), 64 states have return successors, (3456), 3396 states have call predecessors, (3456), 3456 states have call successors, (3456) [2025-02-05 21:55:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10641 states to 10641 states and 17896 transitions. [2025-02-05 21:55:28,562 INFO L78 Accepts]: Start accepts. Automaton has 10641 states and 17896 transitions. Word has length 785 [2025-02-05 21:55:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:28,563 INFO L471 AbstractCegarLoop]: Abstraction has 10641 states and 17896 transitions. [2025-02-05 21:55:28,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:28,564 INFO L276 IsEmpty]: Start isEmpty. Operand 10641 states and 17896 transitions. [2025-02-05 21:55:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:28,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:28,574 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:55:28,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:28,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2146549554, now seen corresponding path program 1 times [2025-02-05 21:55:28,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:28,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442462907] [2025-02-05 21:55:28,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:28,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:28,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:28,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:28,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:28,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442462907] [2025-02-05 21:55:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442462907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:28,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:28,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462776513] [2025-02-05 21:55:28,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:28,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:28,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:28,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:28,794 INFO L87 Difference]: Start difference. First operand 10641 states and 17896 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:29,402 INFO L93 Difference]: Finished difference Result 29841 states and 49934 transitions. [2025-02-05 21:55:29,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:29,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:29,509 INFO L225 Difference]: With dead ends: 29841 [2025-02-05 21:55:29,509 INFO L226 Difference]: Without dead ends: 19203 [2025-02-05 21:55:29,547 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:55:29,548 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 320 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:29,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1474 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:29,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19203 states. [2025-02-05 21:55:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19203 to 19185. [2025-02-05 21:55:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19185 states, 12384 states have (on average 1.4928940568475453) internal successors, (18488), 12508 states have internal predecessors, (18488), 6672 states have call successors, (6672), 128 states have call predecessors, (6672), 128 states have return successors, (6672), 6548 states have call predecessors, (6672), 6672 states have call successors, (6672) [2025-02-05 21:55:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19185 states to 19185 states and 31832 transitions. [2025-02-05 21:55:30,989 INFO L78 Accepts]: Start accepts. Automaton has 19185 states and 31832 transitions. Word has length 785 [2025-02-05 21:55:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:30,990 INFO L471 AbstractCegarLoop]: Abstraction has 19185 states and 31832 transitions. [2025-02-05 21:55:30,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:30,991 INFO L276 IsEmpty]: Start isEmpty. Operand 19185 states and 31832 transitions. [2025-02-05 21:55:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:31,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:31,006 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:55:31,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:31,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:31,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1151345389, now seen corresponding path program 1 times [2025-02-05 21:55:31,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:31,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546254944] [2025-02-05 21:55:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:31,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:31,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:31,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546254944] [2025-02-05 21:55:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546254944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376243516] [2025-02-05 21:55:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:31,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:31,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:31,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:31,199 INFO L87 Difference]: Start difference. First operand 19185 states and 31832 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:31,888 INFO L93 Difference]: Finished difference Result 38529 states and 63790 transitions. [2025-02-05 21:55:31,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 785 [2025-02-05 21:55:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:31,984 INFO L225 Difference]: With dead ends: 38529 [2025-02-05 21:55:31,984 INFO L226 Difference]: Without dead ends: 19347 [2025-02-05 21:55:32,048 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:55:32,051 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 318 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:32,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1374 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19347 states. [2025-02-05 21:55:32,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19347 to 13745. [2025-02-05 21:55:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13745 states, 9632 states have (on average 1.5307308970099667) internal successors, (14744), 9692 states have internal predecessors, (14744), 4016 states have call successors, (4016), 96 states have call predecessors, (4016), 96 states have return successors, (4016), 3956 states have call predecessors, (4016), 4016 states have call successors, (4016) [2025-02-05 21:55:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13745 states to 13745 states and 22776 transitions. [2025-02-05 21:55:33,033 INFO L78 Accepts]: Start accepts. Automaton has 13745 states and 22776 transitions. Word has length 785 [2025-02-05 21:55:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:33,034 INFO L471 AbstractCegarLoop]: Abstraction has 13745 states and 22776 transitions. [2025-02-05 21:55:33,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13745 states and 22776 transitions. [2025-02-05 21:55:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-02-05 21:55:33,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:33,047 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:55:33,047 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1656904014, now seen corresponding path program 1 times [2025-02-05 21:55:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:33,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70914405] [2025-02-05 21:55:33,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:33,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:33,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-02-05 21:55:33,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-02-05 21:55:33,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:33,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70914405] [2025-02-05 21:55:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70914405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:33,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:33,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:55:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689994981] [2025-02-05 21:55:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:33,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:55:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:33,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:55:33,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:55:33,642 INFO L87 Difference]: Start difference. First operand 13745 states and 22776 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-02-05 21:55:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:36,534 INFO L93 Difference]: Finished difference Result 54971 states and 91095 transitions. [2025-02-05 21:55:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:55:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) Word has length 785 [2025-02-05 21:55:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:36,677 INFO L225 Difference]: With dead ends: 54971 [2025-02-05 21:55:36,677 INFO L226 Difference]: Without dead ends: 41229 [2025-02-05 21:55:36,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:55:36,714 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 937 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:36,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 3064 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:55:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41229 states. [2025-02-05 21:55:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41229 to 41193. [2025-02-05 21:55:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41193 states, 28856 states have (on average 1.5300803992237317) internal successors, (44152), 29036 states have internal predecessors, (44152), 12048 states have call successors, (12048), 288 states have call predecessors, (12048), 288 states have return successors, (12048), 11868 states have call predecessors, (12048), 12048 states have call successors, (12048) [2025-02-05 21:55:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41193 states to 41193 states and 68248 transitions. [2025-02-05 21:55:38,715 INFO L78 Accepts]: Start accepts. Automaton has 41193 states and 68248 transitions. Word has length 785 [2025-02-05 21:55:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:38,716 INFO L471 AbstractCegarLoop]: Abstraction has 41193 states and 68248 transitions. [2025-02-05 21:55:38,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 2 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-02-05 21:55:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 41193 states and 68248 transitions. [2025-02-05 21:55:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2025-02-05 21:55:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:38,746 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:38,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:55:38,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:38,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 825529274, now seen corresponding path program 1 times [2025-02-05 21:55:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264294349] [2025-02-05 21:55:38,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:38,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes. [2025-02-05 21:55:38,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements. [2025-02-05 21:55:38,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:38,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264294349] [2025-02-05 21:55:39,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264294349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:39,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109859816] [2025-02-05 21:55:39,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:39,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:39,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:39,121 INFO L87 Difference]: Start difference. First operand 41193 states and 68248 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:41,858 INFO L93 Difference]: Finished difference Result 102979 states and 170520 transitions. [2025-02-05 21:55:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:41,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 786 [2025-02-05 21:55:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:42,276 INFO L225 Difference]: With dead ends: 102979 [2025-02-05 21:55:42,276 INFO L226 Difference]: Without dead ends: 61789 [2025-02-05 21:55:42,358 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:55:42,359 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 375 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:42,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1195 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61789 states. [2025-02-05 21:55:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61789 to 61787. [2025-02-05 21:55:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61787 states, 43282 states have (on average 1.5256688692759115) internal successors, (66034), 43552 states have internal predecessors, (66034), 18072 states have call successors, (18072), 432 states have call predecessors, (18072), 432 states have return successors, (18072), 17802 states have call predecessors, (18072), 18072 states have call successors, (18072) [2025-02-05 21:55:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61787 states to 61787 states and 102178 transitions. [2025-02-05 21:55:45,792 INFO L78 Accepts]: Start accepts. Automaton has 61787 states and 102178 transitions. Word has length 786 [2025-02-05 21:55:45,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:55:45,793 INFO L471 AbstractCegarLoop]: Abstraction has 61787 states and 102178 transitions. [2025-02-05 21:55:45,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 61787 states and 102178 transitions. [2025-02-05 21:55:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2025-02-05 21:55:45,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:55:45,825 INFO L218 NwaCegarLoop]: trace histogram [126, 126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:45,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:55:45,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:55:45,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:55:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2007858023, now seen corresponding path program 1 times [2025-02-05 21:55:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:55:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419151340] [2025-02-05 21:55:45,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:55:45,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:55:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 786 statements into 1 equivalence classes. [2025-02-05 21:55:45,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 786 of 786 statements. [2025-02-05 21:55:45,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:55:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:55:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 31500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31500 trivial. 0 not checked. [2025-02-05 21:55:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:55:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419151340] [2025-02-05 21:55:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419151340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:55:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:55:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:55:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793318815] [2025-02-05 21:55:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:55:46,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:55:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:55:46,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:55:46,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:55:46,150 INFO L87 Difference]: Start difference. First operand 61787 states and 102178 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) [2025-02-05 21:55:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:55:50,880 INFO L93 Difference]: Finished difference Result 185355 states and 306528 transitions. [2025-02-05 21:55:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:55:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (126), 1 states have call predecessors, (126), 1 states have return successors, (126), 1 states have call predecessors, (126), 1 states have call successors, (126) Word has length 786 [2025-02-05 21:55:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:55:51,560 INFO L225 Difference]: With dead ends: 185355 [2025-02-05 21:55:51,561 INFO L226 Difference]: Without dead ends: 123571 [2025-02-05 21:55:51,738 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:55:51,740 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 368 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:55:51,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1277 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:55:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123571 states.