./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.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-96.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 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:02:51,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:02:51,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:02:51,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:02:51,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:02:51,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:02:51,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:02:51,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:02:51,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:02:51,646 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:02:51,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:02:51,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:02:51,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:02:51,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:02:51,647 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:02:51,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:02:51,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:02:51,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:51,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:02:51,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:02:51,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:02:51,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:02:51,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:02:51,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:02:51,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:02:51,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:02:51,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:02:51,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:02:51,650 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 -> 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 [2025-02-05 22:02:51,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:02:51,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:02:51,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:02:51,892 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:02:51,892 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:02:51,893 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-96.i [2025-02-05 22:02:53,008 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3f502e87/bcba39b85a05498493d73e61c49472b6/FLAG326ad7624 [2025-02-05 22:02:53,342 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:02:53,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-02-05 22:02:53,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3f502e87/bcba39b85a05498493d73e61c49472b6/FLAG326ad7624 [2025-02-05 22:02:53,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3f502e87/bcba39b85a05498493d73e61c49472b6 [2025-02-05 22:02:53,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:02:53,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:02:53,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:53,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:02:53,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:02:53,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:53" (1/1) ... [2025-02-05 22:02:53,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6812484a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:53, skipping insertion in model container [2025-02-05 22:02:53,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:53" (1/1) ... [2025-02-05 22:02:53,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:02:53,777 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-96.i[916,929] [2025-02-05 22:02:53,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:53,958 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:02:53,968 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-96.i[916,929] [2025-02-05 22:02:54,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:54,082 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:02:54,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54 WrapperNode [2025-02-05 22:02:54,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:54,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:54,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:02:54,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:02:54,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,186 INFO L138 Inliner]: procedures = 26, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 889 [2025-02-05 22:02:54,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:54,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:02:54,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:02:54,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:02:54,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,242 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 22:02:54,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,274 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:02:54,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:02:54,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:02:54,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:02:54,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (1/1) ... [2025-02-05 22:02:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:54,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:54,333 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 22:02:54,339 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 22:02:54,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:02:54,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:02:54,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:02:54,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:02:54,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:02:54,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:02:54,493 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:02:54,494 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:02:55,423 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 22:02:55,423 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:02:55,446 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:02:55,446 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:02:55,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:55 BoogieIcfgContainer [2025-02-05 22:02:55,446 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:02:55,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:02:55,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:02:55,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:02:55,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:02:53" (1/3) ... [2025-02-05 22:02:55,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7ba0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:55, skipping insertion in model container [2025-02-05 22:02:55,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:54" (2/3) ... [2025-02-05 22:02:55,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af7ba0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:55, skipping insertion in model container [2025-02-05 22:02:55,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:55" (3/3) ... [2025-02-05 22:02:55,453 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-02-05 22:02:55,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:02:55,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i that has 2 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:02:55,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:02:55,514 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;@133bfe81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:02:55,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:02:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-02-05 22:02:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-02-05 22:02:55,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:55,539 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:55,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:55,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 897616484, now seen corresponding path program 1 times [2025-02-05 22:02:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571174925] [2025-02-05 22:02:55,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:55,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 22:02:55,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 22:02:55,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:55,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-02-05 22:02:56,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571174925] [2025-02-05 22:02:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571174925] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31728042] [2025-02-05 22:02:56,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:56,024 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 22:02:56,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:02:56,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 22:02:56,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 22:02:56,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:56,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:56,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-02-05 22:02:56,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31728042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:56,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062469427] [2025-02-05 22:02:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:56,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:56,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:56,472 INFO L87 Difference]: Start difference. First operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-02-05 22:02:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:56,539 INFO L93 Difference]: Finished difference Result 738 states and 1384 transitions. [2025-02-05 22:02:56,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:56,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) Word has length 755 [2025-02-05 22:02:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:56,548 INFO L225 Difference]: With dead ends: 738 [2025-02-05 22:02:56,549 INFO L226 Difference]: Without dead ends: 367 [2025-02-05 22:02:56,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 756 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 22:02:56,555 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:56,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-05 22:02:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-02-05 22:02:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 246 states have (on average 1.5406504065040652) internal successors, (379), 246 states have internal predecessors, (379), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-02-05 22:02:56,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 617 transitions. [2025-02-05 22:02:56,614 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 617 transitions. Word has length 755 [2025-02-05 22:02:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:56,614 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 617 transitions. [2025-02-05 22:02:56,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-02-05 22:02:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 617 transitions. [2025-02-05 22:02:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-02-05 22:02:56,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:56,626 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:56,635 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 22:02:56,831 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 22:02:56,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:56,833 INFO L85 PathProgramCache]: Analyzing trace with hash -502444065, now seen corresponding path program 1 times [2025-02-05 22:02:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:56,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400217806] [2025-02-05 22:02:56,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:56,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:56,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-02-05 22:02:57,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-02-05 22:02:57,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:57,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:02:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400217806] [2025-02-05 22:02:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400217806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:57,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:57,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612056103] [2025-02-05 22:02:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:57,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:57,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:57,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:57,802 INFO L87 Difference]: Start difference. First operand 367 states and 617 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:58,263 INFO L93 Difference]: Finished difference Result 1375 states and 2319 transitions. [2025-02-05 22:02:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:58,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 755 [2025-02-05 22:02:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:58,271 INFO L225 Difference]: With dead ends: 1375 [2025-02-05 22:02:58,271 INFO L226 Difference]: Without dead ends: 1011 [2025-02-05 22:02:58,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:58,273 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 892 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:58,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 2928 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-02-05 22:02:58,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1002. [2025-02-05 22:02:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 735 states have (on average 1.5850340136054422) internal successors, (1165), 738 states have internal predecessors, (1165), 262 states have call successors, (262), 4 states have call predecessors, (262), 4 states have return successors, (262), 259 states have call predecessors, (262), 262 states have call successors, (262) [2025-02-05 22:02:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1689 transitions. [2025-02-05 22:02:58,353 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1689 transitions. Word has length 755 [2025-02-05 22:02:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:58,354 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1689 transitions. [2025-02-05 22:02:58,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1689 transitions. [2025-02-05 22:02:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-02-05 22:02:58,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:58,366 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:02:58,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:58,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 37609985, now seen corresponding path program 1 times [2025-02-05 22:02:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434910828] [2025-02-05 22:02:58,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:58,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-02-05 22:02:58,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-02-05 22:02:58,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:02:58,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434910828] [2025-02-05 22:02:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434910828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861804421] [2025-02-05 22:02:58,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:58,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:58,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:58,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:58,668 INFO L87 Difference]: Start difference. First operand 1002 states and 1689 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:58,804 INFO L93 Difference]: Finished difference Result 2992 states and 5045 transitions. [2025-02-05 22:02:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-02-05 22:02:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:58,817 INFO L225 Difference]: With dead ends: 2992 [2025-02-05 22:02:58,817 INFO L226 Difference]: Without dead ends: 1993 [2025-02-05 22:02:58,836 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 22:02:58,838 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 603 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:58,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1164 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-02-05 22:02:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1990. [2025-02-05 22:02:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1457 states have (on average 1.5655456417295814) internal successors, (2281), 1463 states have internal predecessors, (2281), 524 states have call successors, (524), 8 states have call predecessors, (524), 8 states have return successors, (524), 518 states have call predecessors, (524), 524 states have call successors, (524) [2025-02-05 22:02:58,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3329 transitions. [2025-02-05 22:02:58,967 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3329 transitions. Word has length 756 [2025-02-05 22:02:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:58,968 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3329 transitions. [2025-02-05 22:02:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3329 transitions. [2025-02-05 22:02:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-02-05 22:02:58,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:58,974 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:58,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:02:58,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:58,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:58,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1615875351, now seen corresponding path program 1 times [2025-02-05 22:02:58,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:58,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919358248] [2025-02-05 22:02:58,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:58,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:59,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-02-05 22:02:59,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-02-05 22:02:59,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:59,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:02:59,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:59,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919358248] [2025-02-05 22:02:59,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919358248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:59,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:59,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:59,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559728103] [2025-02-05 22:02:59,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:59,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:59,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:59,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:59,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:59,257 INFO L87 Difference]: Start difference. First operand 1990 states and 3329 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:59,461 INFO L93 Difference]: Finished difference Result 5536 states and 9270 transitions. [2025-02-05 22:02:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-02-05 22:02:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:59,479 INFO L225 Difference]: With dead ends: 5536 [2025-02-05 22:02:59,479 INFO L226 Difference]: Without dead ends: 3549 [2025-02-05 22:02:59,484 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 22:02:59,485 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 313 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:59,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1164 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2025-02-05 22:02:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3539. [2025-02-05 22:02:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 2726 states have (on average 1.5763022743947175) internal successors, (4297), 2740 states have internal predecessors, (4297), 796 states have call successors, (796), 16 states have call predecessors, (796), 16 states have return successors, (796), 782 states have call predecessors, (796), 796 states have call successors, (796) [2025-02-05 22:02:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5889 transitions. [2025-02-05 22:02:59,723 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5889 transitions. Word has length 757 [2025-02-05 22:02:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5889 transitions. [2025-02-05 22:02:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:02:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5889 transitions. [2025-02-05 22:02:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-02-05 22:02:59,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:59,737 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:59,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:02:59,737 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:59,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash -81017767, now seen corresponding path program 1 times [2025-02-05 22:02:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:59,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627232284] [2025-02-05 22:02:59,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:59,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-02-05 22:02:59,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-02-05 22:02:59,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:59,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627232284] [2025-02-05 22:03:00,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627232284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:00,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:00,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452668757] [2025-02-05 22:03:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:00,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:00,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:00,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,060 INFO L87 Difference]: Start difference. First operand 3539 states and 5889 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:00,253 INFO L93 Difference]: Finished difference Result 7525 states and 12524 transitions. [2025-02-05 22:03:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:00,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-02-05 22:03:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:00,280 INFO L225 Difference]: With dead ends: 7525 [2025-02-05 22:03:00,280 INFO L226 Difference]: Without dead ends: 3989 [2025-02-05 22:03:00,290 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 22:03:00,292 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 320 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:00,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2025-02-05 22:03:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3251. [2025-02-05 22:03:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2766 states have (on average 1.6272595806218366) internal successors, (4501), 2772 states have internal predecessors, (4501), 472 states have call successors, (472), 12 states have call predecessors, (472), 12 states have return successors, (472), 466 states have call predecessors, (472), 472 states have call successors, (472) [2025-02-05 22:03:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 5445 transitions. [2025-02-05 22:03:00,483 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 5445 transitions. Word has length 757 [2025-02-05 22:03:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:00,487 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 5445 transitions. [2025-02-05 22:03:00,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 5445 transitions. [2025-02-05 22:03:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-02-05 22:03:00,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:00,496 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:00,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:03:00,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:00,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:00,500 INFO L85 PathProgramCache]: Analyzing trace with hash -489841992, now seen corresponding path program 1 times [2025-02-05 22:03:00,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:00,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949460845] [2025-02-05 22:03:00,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:00,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-02-05 22:03:00,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-02-05 22:03:00,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949460845] [2025-02-05 22:03:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949460845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:00,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:00,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547492626] [2025-02-05 22:03:00,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:00,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:00,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:00,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,731 INFO L87 Difference]: Start difference. First operand 3251 states and 5445 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:00,955 INFO L93 Difference]: Finished difference Result 9747 states and 16329 transitions. [2025-02-05 22:03:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:00,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-02-05 22:03:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:00,986 INFO L225 Difference]: With dead ends: 9747 [2025-02-05 22:03:00,986 INFO L226 Difference]: Without dead ends: 6499 [2025-02-05 22:03:00,994 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 22:03:00,996 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 590 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:00,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1200 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2025-02-05 22:03:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6497. [2025-02-05 22:03:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 5528 states have (on average 1.6190303907380608) internal successors, (8950), 5540 states have internal predecessors, (8950), 944 states have call successors, (944), 24 states have call predecessors, (944), 24 states have return successors, (944), 932 states have call predecessors, (944), 944 states have call successors, (944) [2025-02-05 22:03:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 10838 transitions. [2025-02-05 22:03:01,299 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 10838 transitions. Word has length 757 [2025-02-05 22:03:01,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:01,300 INFO L471 AbstractCegarLoop]: Abstraction has 6497 states and 10838 transitions. [2025-02-05 22:03:01,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 10838 transitions. [2025-02-05 22:03:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-02-05 22:03:01,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:01,315 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:03:01,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1017709817, now seen corresponding path program 1 times [2025-02-05 22:03:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822992614] [2025-02-05 22:03:01,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:01,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-02-05 22:03:01,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-02-05 22:03:01,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:01,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:01,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:01,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822992614] [2025-02-05 22:03:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822992614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:01,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:01,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:01,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939647039] [2025-02-05 22:03:01,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:01,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:01,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:01,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,816 INFO L87 Difference]: Start difference. First operand 6497 states and 10838 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:02,053 INFO L93 Difference]: Finished difference Result 13027 states and 21745 transitions. [2025-02-05 22:03:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-02-05 22:03:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:02,082 INFO L225 Difference]: With dead ends: 13027 [2025-02-05 22:03:02,082 INFO L226 Difference]: Without dead ends: 6533 [2025-02-05 22:03:02,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:03:02,097 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:02,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1178 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:03:02,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6533 states. [2025-02-05 22:03:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6533 to 6533. [2025-02-05 22:03:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 5564 states have (on average 1.6150251617541338) internal successors, (8986), 5576 states have internal predecessors, (8986), 944 states have call successors, (944), 24 states have call predecessors, (944), 24 states have return successors, (944), 932 states have call predecessors, (944), 944 states have call successors, (944) [2025-02-05 22:03:02,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 10874 transitions. [2025-02-05 22:03:02,338 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 10874 transitions. Word has length 757 [2025-02-05 22:03:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:02,339 INFO L471 AbstractCegarLoop]: Abstraction has 6533 states and 10874 transitions. [2025-02-05 22:03:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 10874 transitions. [2025-02-05 22:03:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-02-05 22:03:02,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:02,350 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:02,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:03:02,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:02,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash -652803752, now seen corresponding path program 1 times [2025-02-05 22:03:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:02,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320127883] [2025-02-05 22:03:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-02-05 22:03:02,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-02-05 22:03:02,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:02,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:02,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320127883] [2025-02-05 22:03:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320127883] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712630427] [2025-02-05 22:03:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:02,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:02,850 INFO L87 Difference]: Start difference. First operand 6533 states and 10874 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:03,232 INFO L93 Difference]: Finished difference Result 19557 states and 32580 transitions. [2025-02-05 22:03:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-02-05 22:03:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:03,284 INFO L225 Difference]: With dead ends: 19557 [2025-02-05 22:03:03,285 INFO L226 Difference]: Without dead ends: 13027 [2025-02-05 22:03:03,297 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 22:03:03,298 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 403 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:03,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1376 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:03,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13027 states. [2025-02-05 22:03:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13027 to 13025. [2025-02-05 22:03:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13025 states, 11088 states have (on average 1.613997113997114) internal successors, (17896), 11112 states have internal predecessors, (17896), 1888 states have call successors, (1888), 48 states have call predecessors, (1888), 48 states have return successors, (1888), 1864 states have call predecessors, (1888), 1888 states have call successors, (1888) [2025-02-05 22:03:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 21672 transitions. [2025-02-05 22:03:03,878 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 21672 transitions. Word has length 757 [2025-02-05 22:03:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:03,879 INFO L471 AbstractCegarLoop]: Abstraction has 13025 states and 21672 transitions. [2025-02-05 22:03:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 21672 transitions. [2025-02-05 22:03:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-02-05 22:03:03,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:03,899 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:03,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:03:03,899 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash 369360405, now seen corresponding path program 1 times [2025-02-05 22:03:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:03,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129205153] [2025-02-05 22:03:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:03,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-02-05 22:03:03,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-02-05 22:03:03,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:03,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129205153] [2025-02-05 22:03:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129205153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:04,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686421992] [2025-02-05 22:03:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:04,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:04,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:04,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:04,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:04,148 INFO L87 Difference]: Start difference. First operand 13025 states and 21672 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:04,606 INFO L93 Difference]: Finished difference Result 26387 states and 43864 transitions. [2025-02-05 22:03:04,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:04,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 759 [2025-02-05 22:03:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:04,651 INFO L225 Difference]: With dead ends: 26387 [2025-02-05 22:03:04,652 INFO L226 Difference]: Without dead ends: 13365 [2025-02-05 22:03:04,684 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 22:03:04,685 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 365 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:04,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1373 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2025-02-05 22:03:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 12083. [2025-02-05 22:03:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12083 states, 10690 states have (on average 1.6215154349859682) internal successors, (17334), 10698 states have internal predecessors, (17334), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1336 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-02-05 22:03:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12083 states to 12083 states and 20022 transitions. [2025-02-05 22:03:05,161 INFO L78 Accepts]: Start accepts. Automaton has 12083 states and 20022 transitions. Word has length 759 [2025-02-05 22:03:05,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:05,162 INFO L471 AbstractCegarLoop]: Abstraction has 12083 states and 20022 transitions. [2025-02-05 22:03:05,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 12083 states and 20022 transitions. [2025-02-05 22:03:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-02-05 22:03:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:05,173 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:03:05,174 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1146149081, now seen corresponding path program 1 times [2025-02-05 22:03:05,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:05,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898424779] [2025-02-05 22:03:05,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:05,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:05,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-02-05 22:03:05,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-02-05 22:03:05,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:05,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898424779] [2025-02-05 22:03:05,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898424779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896144503] [2025-02-05 22:03:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:05,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:05,505 INFO L87 Difference]: Start difference. First operand 12083 states and 20022 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:05,799 INFO L93 Difference]: Finished difference Result 24163 states and 40041 transitions. [2025-02-05 22:03:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 760 [2025-02-05 22:03:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:05,838 INFO L225 Difference]: With dead ends: 24163 [2025-02-05 22:03:05,838 INFO L226 Difference]: Without dead ends: 12083 [2025-02-05 22:03:05,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 22:03:05,864 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:05,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1177 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2025-02-05 22:03:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 12047. [2025-02-05 22:03:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12047 states, 10654 states have (on average 1.6168575183029847) internal successors, (17226), 10662 states have internal predecessors, (17226), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1336 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-02-05 22:03:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12047 states to 12047 states and 19914 transitions. [2025-02-05 22:03:06,242 INFO L78 Accepts]: Start accepts. Automaton has 12047 states and 19914 transitions. Word has length 760 [2025-02-05 22:03:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 12047 states and 19914 transitions. [2025-02-05 22:03:06,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 12047 states and 19914 transitions. [2025-02-05 22:03:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-02-05 22:03:06,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:06,256 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:06,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:03:06,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -524364488, now seen corresponding path program 1 times [2025-02-05 22:03:06,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:06,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997108976] [2025-02-05 22:03:06,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:06,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-02-05 22:03:06,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-02-05 22:03:06,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:06,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997108976] [2025-02-05 22:03:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997108976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174255610] [2025-02-05 22:03:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:06,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:06,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:06,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:06,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:06,741 INFO L87 Difference]: Start difference. First operand 12047 states and 19914 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:07,109 INFO L93 Difference]: Finished difference Result 35479 states and 58600 transitions. [2025-02-05 22:03:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 760 [2025-02-05 22:03:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:07,176 INFO L225 Difference]: With dead ends: 35479 [2025-02-05 22:03:07,176 INFO L226 Difference]: Without dead ends: 23435 [2025-02-05 22:03:07,205 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 22:03:07,206 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 363 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:07,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1249 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2025-02-05 22:03:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 23329. [2025-02-05 22:03:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23329 states, 20544 states have (on average 1.608644859813084) internal successors, (33048), 20560 states have internal predecessors, (33048), 2688 states have call successors, (2688), 96 states have call predecessors, (2688), 96 states have return successors, (2688), 2672 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-02-05 22:03:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 38424 transitions. [2025-02-05 22:03:08,298 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 38424 transitions. Word has length 760 [2025-02-05 22:03:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:08,301 INFO L471 AbstractCegarLoop]: Abstraction has 23329 states and 38424 transitions. [2025-02-05 22:03:08,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 38424 transitions. [2025-02-05 22:03:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-02-05 22:03:08,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:08,323 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:03:08,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1787481194, now seen corresponding path program 1 times [2025-02-05 22:03:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:08,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551238544] [2025-02-05 22:03:08,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-02-05 22:03:08,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-02-05 22:03:08,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:08,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:08,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551238544] [2025-02-05 22:03:08,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551238544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:08,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:08,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414889301] [2025-02-05 22:03:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:08,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:08,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:08,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:08,753 INFO L87 Difference]: Start difference. First operand 23329 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:09,191 INFO L93 Difference]: Finished difference Result 46655 states and 76845 transitions. [2025-02-05 22:03:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 762 [2025-02-05 22:03:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:09,262 INFO L225 Difference]: With dead ends: 46655 [2025-02-05 22:03:09,262 INFO L226 Difference]: Without dead ends: 23329 [2025-02-05 22:03:09,297 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 22:03:09,298 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 341 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:09,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 594 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:03:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23329 states. [2025-02-05 22:03:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23329 to 23329. [2025-02-05 22:03:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23329 states, 20544 states have (on average 1.6070872274143302) internal successors, (33016), 20560 states have internal predecessors, (33016), 2688 states have call successors, (2688), 96 states have call predecessors, (2688), 96 states have return successors, (2688), 2672 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-02-05 22:03:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 38392 transitions. [2025-02-05 22:03:10,037 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 38392 transitions. Word has length 762 [2025-02-05 22:03:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 23329 states and 38392 transitions. [2025-02-05 22:03:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 38392 transitions. [2025-02-05 22:03:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-02-05 22:03:10,052 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:10,053 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:03:10,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:10,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1156998710, now seen corresponding path program 1 times [2025-02-05 22:03:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:10,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650069380] [2025-02-05 22:03:10,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:10,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-02-05 22:03:10,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-02-05 22:03:10,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:10,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:10,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650069380] [2025-02-05 22:03:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650069380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:10,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:10,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:03:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754424479] [2025-02-05 22:03:10,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:10,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:03:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:10,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:03:10,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:03:10,618 INFO L87 Difference]: Start difference. First operand 23329 states and 38392 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:11,669 INFO L93 Difference]: Finished difference Result 70133 states and 115474 transitions. [2025-02-05 22:03:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:03:11,669 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), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-02-05 22:03:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:11,784 INFO L225 Difference]: With dead ends: 70133 [2025-02-05 22:03:11,784 INFO L226 Difference]: Without dead ends: 46807 [2025-02-05 22:03:11,827 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 22:03:11,828 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 384 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:11,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1532 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:03:11,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46807 states. [2025-02-05 22:03:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46807 to 46653. [2025-02-05 22:03:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46653 states, 41084 states have (on average 1.603446597215461) internal successors, (65876), 41116 states have internal predecessors, (65876), 5376 states have call successors, (5376), 192 states have call predecessors, (5376), 192 states have return successors, (5376), 5344 states have call predecessors, (5376), 5376 states have call successors, (5376) [2025-02-05 22:03:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46653 states to 46653 states and 76628 transitions. [2025-02-05 22:03:13,954 INFO L78 Accepts]: Start accepts. Automaton has 46653 states and 76628 transitions. Word has length 764 [2025-02-05 22:03:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:13,956 INFO L471 AbstractCegarLoop]: Abstraction has 46653 states and 76628 transitions. [2025-02-05 22:03:13,956 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), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 46653 states and 76628 transitions. [2025-02-05 22:03:13,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-02-05 22:03:13,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:13,981 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:13,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:03:13,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -773620395, now seen corresponding path program 1 times [2025-02-05 22:03:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169740627] [2025-02-05 22:03:13,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-02-05 22:03:14,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-02-05 22:03:14,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:14,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169740627] [2025-02-05 22:03:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169740627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:03:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712490614] [2025-02-05 22:03:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:14,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:03:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:14,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:03:14,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:03:14,643 INFO L87 Difference]: Start difference. First operand 46653 states and 76628 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:19,948 INFO L93 Difference]: Finished difference Result 251975 states and 414105 transitions. [2025-02-05 22:03:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:03:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-02-05 22:03:19,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:20,424 INFO L225 Difference]: With dead ends: 251975 [2025-02-05 22:03:20,424 INFO L226 Difference]: Without dead ends: 205325 [2025-02-05 22:03:20,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:03:20,569 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 2285 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:20,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 2490 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 22:03:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205325 states. [2025-02-05 22:03:26,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205325 to 204997. [2025-02-05 22:03:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204997 states, 185316 states have (on average 1.60696324116644) internal successors, (297796), 185572 states have internal predecessors, (297796), 18848 states have call successors, (18848), 832 states have call predecessors, (18848), 832 states have return successors, (18848), 18592 states have call predecessors, (18848), 18848 states have call successors, (18848) [2025-02-05 22:03:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204997 states to 204997 states and 335492 transitions. [2025-02-05 22:03:27,790 INFO L78 Accepts]: Start accepts. Automaton has 204997 states and 335492 transitions. Word has length 764 [2025-02-05 22:03:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:27,791 INFO L471 AbstractCegarLoop]: Abstraction has 204997 states and 335492 transitions. [2025-02-05 22:03:27,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 204997 states and 335492 transitions. [2025-02-05 22:03:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-02-05 22:03:27,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:27,893 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:03:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:03:27,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash -335610892, now seen corresponding path program 1 times [2025-02-05 22:03:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:27,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987920967] [2025-02-05 22:03:27,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:27,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:28,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-02-05 22:03:28,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-02-05 22:03:28,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:28,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-02-05 22:03:30,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987920967] [2025-02-05 22:03:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987920967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:03:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888495473] [2025-02-05 22:03:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:30,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:03:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:30,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:03:30,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:03:30,072 INFO L87 Difference]: Start difference. First operand 204997 states and 335492 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-02-05 22:03:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:49,375 INFO L93 Difference]: Finished difference Result 714101 states and 1157884 transitions. [2025-02-05 22:03:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 22:03:49,376 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), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-02-05 22:03:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:51,152 INFO L225 Difference]: With dead ends: 714101 [2025-02-05 22:03:51,152 INFO L226 Difference]: Without dead ends: 509107 [2025-02-05 22:03:51,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-02-05 22:03:51,400 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2284 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:51,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 3185 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1450 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 22:03:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509107 states.