./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.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-57.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 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:59:12,393 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:59:12,430 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:59:12,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:59:12,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:59:12,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:59:12,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:59:12,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:59:12,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:59:12,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:59:12,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:59:12,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:59:12,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:59:12,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:12,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:59:12,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:59:12,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:59:12,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:59:12,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:59:12,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:59:12,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:59:12,450 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 -> 85317af79e2001c8e1b318bf68e7fdcd0f9e26e9789b5022a63d412f2c352aaf [2025-02-05 21:59:12,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:59:12,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:59:12,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:59:12,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:59:12,690 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:59:12,691 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-57.i [2025-02-05 21:59:13,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b374d9c88/d5e96304aff74b5f9fc7a001d4f61329/FLAGe7ddf07c2 [2025-02-05 21:59:14,106 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:59:14,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-02-05 21:59:14,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b374d9c88/d5e96304aff74b5f9fc7a001d4f61329/FLAGe7ddf07c2 [2025-02-05 21:59:14,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b374d9c88/d5e96304aff74b5f9fc7a001d4f61329 [2025-02-05 21:59:14,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:59:14,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:59:14,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:14,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:59:14,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:59:14,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411c5b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14, skipping insertion in model container [2025-02-05 21:59:14,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:59:14,498 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-57.i[916,929] [2025-02-05 21:59:14,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:14,682 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:59:14,695 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-57.i[916,929] [2025-02-05 21:59:14,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:59:14,790 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:59:14,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14 WrapperNode [2025-02-05 21:59:14,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:59:14,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:14,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:59:14,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:59:14,800 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:59:14" (1/1) ... [2025-02-05 21:59:14,815 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:59:14" (1/1) ... [2025-02-05 21:59:14,876 INFO L138 Inliner]: procedures = 26, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 888 [2025-02-05 21:59:14,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:59:14,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:59:14,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:59:14,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:59:14,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,920 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:59:14,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:59:14,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:59:14,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:59:14,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:59:14,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (1/1) ... [2025-02-05 21:59:14,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:59:14,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:15,010 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:59:15,015 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:59:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:59:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:59:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:59:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:59:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:59:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:59:15,129 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:59:15,130 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:59:15,935 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L722: havoc property_#t~bitwise84#1;havoc property_#t~short85#1;havoc property_#t~bitwise86#1;havoc property_#t~short87#1; [2025-02-05 21:59:16,073 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 21:59:16,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:59:16,112 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:59:16,113 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:59:16,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:16 BoogieIcfgContainer [2025-02-05 21:59:16,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:59:16,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:59:16,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:59:16,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:59:16,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:59:14" (1/3) ... [2025-02-05 21:59:16,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41381010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:16, skipping insertion in model container [2025-02-05 21:59:16,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:59:14" (2/3) ... [2025-02-05 21:59:16,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41381010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:59:16, skipping insertion in model container [2025-02-05 21:59:16,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:59:16" (3/3) ... [2025-02-05 21:59:16,122 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i [2025-02-05 21:59:16,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:59:16,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-57.i that has 2 procedures, 367 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:59:16,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:59:16,208 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;@be83f64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:59:16,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:59:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 21:59:16,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 21:59:16,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:16,234 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:16,235 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2111600142, now seen corresponding path program 1 times [2025-02-05 21:59:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:16,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144707197] [2025-02-05 21:59:16,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:16,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 21:59:16,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 21:59:16,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:16,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2025-02-05 21:59:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144707197] [2025-02-05 21:59:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144707197] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:59:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043991200] [2025-02-05 21:59:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:16,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:59:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:59:16,905 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:59:16,906 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:59:17,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 21:59:17,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 21:59:17,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:17,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:17,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:59:17,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:59:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 25088 trivial. 0 not checked. [2025-02-05 21:59:17,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:59:17,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043991200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:17,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:59:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:59:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575237320] [2025-02-05 21:59:17,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:17,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:59:17,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:17,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:59:17,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:59:17,456 INFO L87 Difference]: Start difference. First operand has 367 states, 251 states have (on average 1.5737051792828685) internal successors, (395), 252 states have internal predecessors, (395), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:17,537 INFO L93 Difference]: Finished difference Result 728 states and 1350 transitions. [2025-02-05 21:59:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:59:17,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) Word has length 733 [2025-02-05 21:59:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:17,550 INFO L225 Difference]: With dead ends: 728 [2025-02-05 21:59:17,550 INFO L226 Difference]: Without dead ends: 364 [2025-02-05 21:59:17,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 734 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:59:17,558 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:17,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:59:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-05 21:59:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-02-05 21:59:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 249 states have (on average 1.5662650602409638) internal successors, (390), 249 states have internal predecessors, (390), 113 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 21:59:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 616 transitions. [2025-02-05 21:59:17,641 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 616 transitions. Word has length 733 [2025-02-05 21:59:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:17,642 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 616 transitions. [2025-02-05 21:59:17,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 2 states have call successors, (113), 2 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 616 transitions. [2025-02-05 21:59:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 21:59:17,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:17,658 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:17,667 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:59:17,859 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:59:17,859 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1351638293, now seen corresponding path program 1 times [2025-02-05 21:59:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847421371] [2025-02-05 21:59:17,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:17,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 21:59:18,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 21:59:18,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:18,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:18,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847421371] [2025-02-05 21:59:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847421371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605081207] [2025-02-05 21:59:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:18,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:18,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:18,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:18,647 INFO L87 Difference]: Start difference. First operand 364 states and 616 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:18,764 INFO L93 Difference]: Finished difference Result 960 states and 1634 transitions. [2025-02-05 21:59:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:18,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-02-05 21:59:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:18,774 INFO L225 Difference]: With dead ends: 960 [2025-02-05 21:59:18,774 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 21:59:18,775 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:59:18,776 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 403 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:18,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1551 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 21:59:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-02-05 21:59:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.6176470588235294) internal successors, (715), 443 states have internal predecessors, (715), 151 states have call successors, (151), 2 states have call predecessors, (151), 2 states have return successors, (151), 150 states have call predecessors, (151), 151 states have call successors, (151) [2025-02-05 21:59:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1017 transitions. [2025-02-05 21:59:18,853 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1017 transitions. Word has length 733 [2025-02-05 21:59:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:18,854 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 1017 transitions. [2025-02-05 21:59:18,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1017 transitions. [2025-02-05 21:59:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 21:59:18,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:18,879 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:18,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:59:18,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:18,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 823272692, now seen corresponding path program 1 times [2025-02-05 21:59:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399659136] [2025-02-05 21:59:18,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:18,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:18,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 21:59:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 21:59:19,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399659136] [2025-02-05 21:59:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399659136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958810382] [2025-02-05 21:59:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:19,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:19,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:19,387 INFO L87 Difference]: Start difference. First operand 596 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:19,501 INFO L93 Difference]: Finished difference Result 1781 states and 3043 transitions. [2025-02-05 21:59:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:19,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-02-05 21:59:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:19,511 INFO L225 Difference]: With dead ends: 1781 [2025-02-05 21:59:19,511 INFO L226 Difference]: Without dead ends: 1188 [2025-02-05 21:59:19,513 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:59:19,517 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 594 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:19,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1532 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-02-05 21:59:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1186. [2025-02-05 21:59:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 879 states have (on average 1.6154721274175199) internal successors, (1420), 881 states have internal predecessors, (1420), 302 states have call successors, (302), 4 states have call predecessors, (302), 4 states have return successors, (302), 300 states have call predecessors, (302), 302 states have call successors, (302) [2025-02-05 21:59:19,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2024 transitions. [2025-02-05 21:59:19,683 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2024 transitions. Word has length 733 [2025-02-05 21:59:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:19,684 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 2024 transitions. [2025-02-05 21:59:19,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2024 transitions. [2025-02-05 21:59:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 21:59:19,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:19,689 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:19,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:59:19,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:19,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1431349555, now seen corresponding path program 1 times [2025-02-05 21:59:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:19,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830691053] [2025-02-05 21:59:19,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:19,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 21:59:19,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 21:59:19,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830691053] [2025-02-05 21:59:20,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830691053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:20,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:20,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:59:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28837174] [2025-02-05 21:59:20,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:20,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:59:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:20,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:59:20,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:59:20,438 INFO L87 Difference]: Start difference. First operand 1186 states and 2024 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:20,612 INFO L93 Difference]: Finished difference Result 3552 states and 6066 transitions. [2025-02-05 21:59:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:20,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 733 [2025-02-05 21:59:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:20,625 INFO L225 Difference]: With dead ends: 3552 [2025-02-05 21:59:20,625 INFO L226 Difference]: Without dead ends: 2369 [2025-02-05 21:59:20,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:59:20,629 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 393 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:20,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1334 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:59:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-02-05 21:59:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2363. [2025-02-05 21:59:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1750 states have (on average 1.6137142857142857) internal successors, (2824), 1754 states have internal predecessors, (2824), 604 states have call successors, (604), 8 states have call predecessors, (604), 8 states have return successors, (604), 600 states have call predecessors, (604), 604 states have call successors, (604) [2025-02-05 21:59:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 4032 transitions. [2025-02-05 21:59:20,850 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 4032 transitions. Word has length 733 [2025-02-05 21:59:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:20,851 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 4032 transitions. [2025-02-05 21:59:20,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 4032 transitions. [2025-02-05 21:59:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:59:20,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:20,857 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:20,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:59:20,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:20,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1692116495, now seen corresponding path program 1 times [2025-02-05 21:59:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966622398] [2025-02-05 21:59:20,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:59:20,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:59:20,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:20,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:21,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966622398] [2025-02-05 21:59:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966622398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:21,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397340053] [2025-02-05 21:59:21,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:21,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:21,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:21,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:21,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:21,343 INFO L87 Difference]: Start difference. First operand 2363 states and 4032 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:22,135 INFO L93 Difference]: Finished difference Result 7790 states and 13315 transitions. [2025-02-05 21:59:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:59:22,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-02-05 21:59:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:22,163 INFO L225 Difference]: With dead ends: 7790 [2025-02-05 21:59:22,163 INFO L226 Difference]: Without dead ends: 6607 [2025-02-05 21:59:22,167 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:59:22,168 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1761 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1761 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:22,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1761 Valid, 1622 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:59:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2025-02-05 21:59:22,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 6599. [2025-02-05 21:59:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 5026 states have (on average 1.6291285316354953) internal successors, (8188), 5042 states have internal predecessors, (8188), 1548 states have call successors, (1548), 24 states have call predecessors, (1548), 24 states have return successors, (1548), 1532 states have call predecessors, (1548), 1548 states have call successors, (1548) [2025-02-05 21:59:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 11284 transitions. [2025-02-05 21:59:22,702 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 11284 transitions. Word has length 734 [2025-02-05 21:59:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:22,703 INFO L471 AbstractCegarLoop]: Abstraction has 6599 states and 11284 transitions. [2025-02-05 21:59:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 11284 transitions. [2025-02-05 21:59:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:59:22,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:22,715 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:22,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:59:22,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:22,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:22,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1117795250, now seen corresponding path program 1 times [2025-02-05 21:59:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:22,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110843838] [2025-02-05 21:59:22,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:22,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:59:22,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:59:22,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:22,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110843838] [2025-02-05 21:59:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110843838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:24,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 21:59:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842699247] [2025-02-05 21:59:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:24,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:59:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:24,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:59:24,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:59:24,289 INFO L87 Difference]: Start difference. First operand 6599 states and 11284 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:27,696 INFO L93 Difference]: Finished difference Result 44113 states and 75326 transitions. [2025-02-05 21:59:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:59:27,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-02-05 21:59:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:27,838 INFO L225 Difference]: With dead ends: 44113 [2025-02-05 21:59:27,838 INFO L226 Difference]: Without dead ends: 37517 [2025-02-05 21:59:27,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:59:27,875 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 4109 mSDsluCounter, 4717 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:27,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 5785 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:59:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37517 states. [2025-02-05 21:59:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37517 to 25648. [2025-02-05 21:59:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25648 states, 20206 states have (on average 1.648520241512422) internal successors, (33310), 20279 states have internal predecessors, (33310), 5344 states have call successors, (5344), 97 states have call predecessors, (5344), 97 states have return successors, (5344), 5271 states have call predecessors, (5344), 5344 states have call successors, (5344) [2025-02-05 21:59:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25648 states to 25648 states and 43998 transitions. [2025-02-05 21:59:29,531 INFO L78 Accepts]: Start accepts. Automaton has 25648 states and 43998 transitions. Word has length 734 [2025-02-05 21:59:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:29,532 INFO L471 AbstractCegarLoop]: Abstraction has 25648 states and 43998 transitions. [2025-02-05 21:59:29,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25648 states and 43998 transitions. [2025-02-05 21:59:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:59:29,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:29,557 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:29,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:59:29,557 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:29,558 INFO L85 PathProgramCache]: Analyzing trace with hash -552718319, now seen corresponding path program 1 times [2025-02-05 21:59:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:29,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980218401] [2025-02-05 21:59:29,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:29,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:59:29,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:59:29,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:29,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:30,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:30,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980218401] [2025-02-05 21:59:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980218401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:30,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:30,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:59:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688592014] [2025-02-05 21:59:30,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:30,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:59:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:30,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:59:30,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:59:30,146 INFO L87 Difference]: Start difference. First operand 25648 states and 43998 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-02-05 21:59:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:32,047 INFO L93 Difference]: Finished difference Result 76456 states and 131164 transitions. [2025-02-05 21:59:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:32,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) Word has length 734 [2025-02-05 21:59:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:32,213 INFO L225 Difference]: With dead ends: 76456 [2025-02-05 21:59:32,213 INFO L226 Difference]: Without dead ends: 50860 [2025-02-05 21:59:32,280 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:59:32,281 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1010 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1888 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:32,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1888 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:59:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50860 states. [2025-02-05 21:59:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50860 to 50858. [2025-02-05 21:59:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50858 states, 40004 states have (on average 1.6383361663833618) internal successors, (65540), 40149 states have internal predecessors, (65540), 10660 states have call successors, (10660), 193 states have call predecessors, (10660), 193 states have return successors, (10660), 10515 states have call predecessors, (10660), 10660 states have call successors, (10660) [2025-02-05 21:59:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50858 states to 50858 states and 86860 transitions. [2025-02-05 21:59:35,941 INFO L78 Accepts]: Start accepts. Automaton has 50858 states and 86860 transitions. Word has length 734 [2025-02-05 21:59:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:35,942 INFO L471 AbstractCegarLoop]: Abstraction has 50858 states and 86860 transitions. [2025-02-05 21:59:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 3 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 3 states have call predecessors, (113), 3 states have call successors, (113) [2025-02-05 21:59:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 50858 states and 86860 transitions. [2025-02-05 21:59:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:59:35,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:35,973 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:35,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:59:35,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 589429649, now seen corresponding path program 1 times [2025-02-05 21:59:35,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:35,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896046162] [2025-02-05 21:59:35,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:36,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:59:36,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:59:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:36,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896046162] [2025-02-05 21:59:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896046162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:36,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:59:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894053268] [2025-02-05 21:59:36,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:36,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:59:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:36,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:59:36,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:36,580 INFO L87 Difference]: Start difference. First operand 50858 states and 86860 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:39,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:39,142 INFO L93 Difference]: Finished difference Result 134196 states and 229226 transitions. [2025-02-05 21:59:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:59:39,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) Word has length 734 [2025-02-05 21:59:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:39,430 INFO L225 Difference]: With dead ends: 134196 [2025-02-05 21:59:39,430 INFO L226 Difference]: Without dead ends: 83390 [2025-02-05 21:59:39,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:59:39,522 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 840 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:39,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1312 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:59:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83390 states. [2025-02-05 21:59:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83390 to 83386. [2025-02-05 21:59:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83386 states, 65582 states have (on average 1.635479247354457) internal successors, (107258), 65814 states have internal predecessors, (107258), 17489 states have call successors, (17489), 314 states have call predecessors, (17489), 314 states have return successors, (17489), 17257 states have call predecessors, (17489), 17489 states have call successors, (17489) [2025-02-05 21:59:45,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83386 states to 83386 states and 142236 transitions. [2025-02-05 21:59:45,456 INFO L78 Accepts]: Start accepts. Automaton has 83386 states and 142236 transitions. Word has length 734 [2025-02-05 21:59:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:59:45,457 INFO L471 AbstractCegarLoop]: Abstraction has 83386 states and 142236 transitions. [2025-02-05 21:59:45,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 2 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 2 states have call predecessors, (113), 2 states have call successors, (113) [2025-02-05 21:59:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 83386 states and 142236 transitions. [2025-02-05 21:59:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:59:45,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:59:45,496 INFO L218 NwaCegarLoop]: trace histogram [113, 113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:45,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:59:45,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:59:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:59:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1542631282, now seen corresponding path program 1 times [2025-02-05 21:59:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:59:45,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301456411] [2025-02-05 21:59:45,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:59:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:59:45,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:59:45,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:59:45,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:59:45,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:59:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 25312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25312 trivial. 0 not checked. [2025-02-05 21:59:46,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:59:46,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301456411] [2025-02-05 21:59:46,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301456411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:59:46,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:59:46,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:59:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730989144] [2025-02-05 21:59:46,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:59:46,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:59:46,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:59:46,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:59:46,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:59:46,547 INFO L87 Difference]: Start difference. First operand 83386 states and 142236 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) [2025-02-05 21:59:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:59:51,881 INFO L93 Difference]: Finished difference Result 194287 states and 331225 transitions. [2025-02-05 21:59:51,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:59:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 1 states have call successors, (113), 1 states have call predecessors, (113), 1 states have return successors, (113), 1 states have call predecessors, (113), 1 states have call successors, (113) Word has length 734 [2025-02-05 21:59:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:59:52,451 INFO L225 Difference]: With dead ends: 194287 [2025-02-05 21:59:52,452 INFO L226 Difference]: Without dead ends: 143481 [2025-02-05 21:59:52,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:59:52,637 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 3433 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3433 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:59:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3433 Valid, 3768 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:59:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143481 states.