./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-87.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-87.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 e351b09091f4928b194f2e7d66bfc699d33aae8088e7aec6fdfc05d9be7af5eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:02:00,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:02:00,565 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:00,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:02:00,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:02:00,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:02:00,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:02:00,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:02:00,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:02:00,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:02:00,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:02:00,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:02:00,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:02:00,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:02:00,582 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:02:00,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:02:00,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:02:00,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:02:00,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:00,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:02:00,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:02:00,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:02:00,585 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 -> e351b09091f4928b194f2e7d66bfc699d33aae8088e7aec6fdfc05d9be7af5eb [2025-02-05 22:02:00,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:02:00,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:02:00,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:02:00,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:02:00,788 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:02:00,789 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-87.i [2025-02-05 22:02:02,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/045944f3d/1a2e077bd9e2498c8ae9fe82fb21125e/FLAG395c3ee11 [2025-02-05 22:02:02,329 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:02:02,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-87.i [2025-02-05 22:02:02,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/045944f3d/1a2e077bd9e2498c8ae9fe82fb21125e/FLAG395c3ee11 [2025-02-05 22:02:02,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/045944f3d/1a2e077bd9e2498c8ae9fe82fb21125e [2025-02-05 22:02:02,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:02:02,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:02:02,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:02,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:02:02,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:02:02,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:02" (1/1) ... [2025-02-05 22:02:02,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c94dd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:02, skipping insertion in model container [2025-02-05 22:02:02,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:02" (1/1) ... [2025-02-05 22:02:02,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:02:02,698 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-87.i[916,929] [2025-02-05 22:02:02,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:02,810 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:02:02,816 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-87.i[916,929] [2025-02-05 22:02:02,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:02,878 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:02:02,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:02 WrapperNode [2025-02-05 22:02:02,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:02,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:02,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:02:02,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:02:02,883 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:02" (1/1) ... [2025-02-05 22:02:02,898 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:02" (1/1) ... [2025-02-05 22:02:02,948 INFO L138 Inliner]: procedures = 26, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 864 [2025-02-05 22:02:02,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:02,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:02:02,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:02:02,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:02:02,955 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:02" (1/1) ... [2025-02-05 22:02:02,956 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:02" (1/1) ... [2025-02-05 22:02:02,962 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:02" (1/1) ... [2025-02-05 22:02:02,979 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:02,980 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:02" (1/1) ... [2025-02-05 22:02:02,980 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:02" (1/1) ... [2025-02-05 22:02:02,995 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:02" (1/1) ... [2025-02-05 22:02:02,996 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:02" (1/1) ... [2025-02-05 22:02:02,999 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:02" (1/1) ... [2025-02-05 22:02:03,001 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:02" (1/1) ... [2025-02-05 22:02:03,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:02:03,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:02:03,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:02:03,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:02:03,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:02" (1/1) ... [2025-02-05 22:02:03,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:03,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:03,038 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:03,042 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:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:02:03,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:02:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:02:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:02:03,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:02:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:02:03,165 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:02:03,166 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:02:04,229 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 22:02:04,230 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:02:04,264 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:02:04,264 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:02:04,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:04 BoogieIcfgContainer [2025-02-05 22:02:04,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:02:04,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:02:04,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:02:04,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:02:04,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:02:02" (1/3) ... [2025-02-05 22:02:04,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cb7467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:04, skipping insertion in model container [2025-02-05 22:02:04,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:02" (2/3) ... [2025-02-05 22:02:04,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cb7467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:04, skipping insertion in model container [2025-02-05 22:02:04,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:04" (3/3) ... [2025-02-05 22:02:04,273 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-87.i [2025-02-05 22:02:04,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:02:04,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-87.i that has 2 procedures, 358 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:02:04,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:02:04,343 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;@2e851428, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:02:04,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:02:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 242 states have internal predecessors, (380), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 22:02:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 22:02:04,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:04,368 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:04,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:04,372 INFO L85 PathProgramCache]: Analyzing trace with hash 563772800, now seen corresponding path program 1 times [2025-02-05 22:02:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:04,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174690669] [2025-02-05 22:02:04,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:04,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 22:02:04,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 22:02:04,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-02-05 22:02:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174690669] [2025-02-05 22:02:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174690669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508585935] [2025-02-05 22:02:04,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:04,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:04,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:04,996 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:05,000 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:05,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 22:02:05,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 22:02:05,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:05,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:05,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:05,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-02-05 22:02:05,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508585935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110084020] [2025-02-05 22:02:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:05,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:05,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:05,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:05,531 INFO L87 Difference]: Start difference. First operand has 358 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 242 states have internal predecessors, (380), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 22:02:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:05,629 INFO L93 Difference]: Finished difference Result 710 states and 1325 transitions. [2025-02-05 22:02:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) Word has length 731 [2025-02-05 22:02:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:05,641 INFO L225 Difference]: With dead ends: 710 [2025-02-05 22:02:05,641 INFO L226 Difference]: Without dead ends: 355 [2025-02-05 22:02:05,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 732 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:05,651 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:05,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-05 22:02:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-02-05 22:02:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.5564853556485356) internal successors, (372), 239 states have internal predecessors, (372), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 22:02:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 600 transitions. [2025-02-05 22:02:05,732 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 600 transitions. Word has length 731 [2025-02-05 22:02:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,733 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 600 transitions. [2025-02-05 22:02:05,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 22:02:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 600 transitions. [2025-02-05 22:02:05,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 22:02:05,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,749 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 22:02:05,953 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:05,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1338487193, now seen corresponding path program 1 times [2025-02-05 22:02:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770108733] [2025-02-05 22:02:05,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:06,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 22:02:06,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 22:02:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770108733] [2025-02-05 22:02:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770108733] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504021316] [2025-02-05 22:02:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:06,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:06,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:06,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:06,786 INFO L87 Difference]: Start difference. First operand 355 states and 600 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:06,898 INFO L93 Difference]: Finished difference Result 942 states and 1603 transitions. [2025-02-05 22:02:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:06,898 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-02-05 22:02:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:06,907 INFO L225 Difference]: With dead ends: 942 [2025-02-05 22:02:06,909 INFO L226 Difference]: Without dead ends: 590 [2025-02-05 22:02:06,910 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:06,911 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 394 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:06,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1257 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-02-05 22:02:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 587. [2025-02-05 22:02:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 428 states have (on average 1.6144859813084111) internal successors, (691), 429 states have internal predecessors, (691), 156 states have call successors, (156), 2 states have call predecessors, (156), 2 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2025-02-05 22:02:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1003 transitions. [2025-02-05 22:02:06,979 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1003 transitions. Word has length 732 [2025-02-05 22:02:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:06,980 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 1003 transitions. [2025-02-05 22:02:06,980 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1003 transitions. [2025-02-05 22:02:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:06,996 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:02:06,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:06,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash -990754451, now seen corresponding path program 1 times [2025-02-05 22:02:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:06,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710177859] [2025-02-05 22:02:06,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:07,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:07,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:07,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:07,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710177859] [2025-02-05 22:02:07,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710177859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:07,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:07,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247459623] [2025-02-05 22:02:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:07,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:07,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:07,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:07,351 INFO L87 Difference]: Start difference. First operand 587 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:07,463 INFO L93 Difference]: Finished difference Result 1601 states and 2743 transitions. [2025-02-05 22:02:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:07,479 INFO L225 Difference]: With dead ends: 1601 [2025-02-05 22:02:07,479 INFO L226 Difference]: Without dead ends: 1017 [2025-02-05 22:02:07,482 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:07,483 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 380 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:07,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1375 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-02-05 22:02:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1014. [2025-02-05 22:02:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 762 states have (on average 1.6286089238845145) internal successors, (1241), 765 states have internal predecessors, (1241), 247 states have call successors, (247), 4 states have call predecessors, (247), 4 states have return successors, (247), 244 states have call predecessors, (247), 247 states have call successors, (247) [2025-02-05 22:02:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1735 transitions. [2025-02-05 22:02:07,592 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1735 transitions. Word has length 733 [2025-02-05 22:02:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 1014 states and 1735 transitions. [2025-02-05 22:02:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1735 transitions. [2025-02-05 22:02:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:07,623 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:02:07,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:07,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1237067538, now seen corresponding path program 1 times [2025-02-05 22:02:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472871331] [2025-02-05 22:02:07,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:07,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:07,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:07,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:07,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472871331] [2025-02-05 22:02:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472871331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176515439] [2025-02-05 22:02:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:07,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:07,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:07,956 INFO L87 Difference]: Start difference. First operand 1014 states and 1735 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:08,090 INFO L93 Difference]: Finished difference Result 2897 states and 4966 transitions. [2025-02-05 22:02:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:08,100 INFO L225 Difference]: With dead ends: 2897 [2025-02-05 22:02:08,100 INFO L226 Difference]: Without dead ends: 1886 [2025-02-05 22:02:08,102 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:08,102 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 386 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1430 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:02:08,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1430 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2025-02-05 22:02:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1883. [2025-02-05 22:02:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1439 states have (on average 1.6302988186240446) internal successors, (2346), 1446 states have internal predecessors, (2346), 435 states have call successors, (435), 8 states have call predecessors, (435), 8 states have return successors, (435), 428 states have call predecessors, (435), 435 states have call successors, (435) [2025-02-05 22:02:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 3216 transitions. [2025-02-05 22:02:08,213 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 3216 transitions. Word has length 733 [2025-02-05 22:02:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 3216 transitions. [2025-02-05 22:02:08,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 3216 transitions. [2025-02-05 22:02:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:08,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:08,220 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:02:08,221 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:08,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1116947665, now seen corresponding path program 1 times [2025-02-05 22:02:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194749021] [2025-02-05 22:02:08,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:08,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:08,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:08,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:08,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:08,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:08,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:08,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194749021] [2025-02-05 22:02:08,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194749021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:08,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:08,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:08,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489930424] [2025-02-05 22:02:08,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:08,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:08,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:08,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:08,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:08,458 INFO L87 Difference]: Start difference. First operand 1883 states and 3216 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:08,624 INFO L93 Difference]: Finished difference Result 5251 states and 8918 transitions. [2025-02-05 22:02:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:08,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:08,641 INFO L225 Difference]: With dead ends: 5251 [2025-02-05 22:02:08,641 INFO L226 Difference]: Without dead ends: 3371 [2025-02-05 22:02:08,646 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:08,646 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 477 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:08,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1153 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2025-02-05 22:02:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2259. [2025-02-05 22:02:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 1815 states have (on average 1.665013774104683) internal successors, (3022), 1822 states have internal predecessors, (3022), 435 states have call successors, (435), 8 states have call predecessors, (435), 8 states have return successors, (435), 428 states have call predecessors, (435), 435 states have call successors, (435) [2025-02-05 22:02:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3892 transitions. [2025-02-05 22:02:08,772 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3892 transitions. Word has length 733 [2025-02-05 22:02:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:08,773 INFO L471 AbstractCegarLoop]: Abstraction has 2259 states and 3892 transitions. [2025-02-05 22:02:08,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3892 transitions. [2025-02-05 22:02:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:08,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:08,779 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:02:08,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash -766147728, now seen corresponding path program 1 times [2025-02-05 22:02:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705855452] [2025-02-05 22:02:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:08,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:08,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:08,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705855452] [2025-02-05 22:02:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705855452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:09,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997968589] [2025-02-05 22:02:09,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:09,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:09,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:09,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:09,002 INFO L87 Difference]: Start difference. First operand 2259 states and 3892 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:09,208 INFO L93 Difference]: Finished difference Result 6587 states and 11352 transitions. [2025-02-05 22:02:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:09,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:09,233 INFO L225 Difference]: With dead ends: 6587 [2025-02-05 22:02:09,233 INFO L226 Difference]: Without dead ends: 4331 [2025-02-05 22:02:09,238 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:09,240 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 342 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:09,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2025-02-05 22:02:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4327. [2025-02-05 22:02:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 3503 states have (on average 1.6631458749643162) internal successors, (5826), 3518 states have internal predecessors, (5826), 807 states have call successors, (807), 16 states have call predecessors, (807), 16 states have return successors, (807), 792 states have call predecessors, (807), 807 states have call successors, (807) [2025-02-05 22:02:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 7440 transitions. [2025-02-05 22:02:09,488 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 7440 transitions. Word has length 733 [2025-02-05 22:02:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:09,489 INFO L471 AbstractCegarLoop]: Abstraction has 4327 states and 7440 transitions. [2025-02-05 22:02:09,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:09,489 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 7440 transitions. [2025-02-05 22:02:09,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:09,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:09,500 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:02:09,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -754831601, now seen corresponding path program 1 times [2025-02-05 22:02:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857329650] [2025-02-05 22:02:09,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:09,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:09,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:09,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:09,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857329650] [2025-02-05 22:02:09,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857329650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:09,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535800376] [2025-02-05 22:02:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:09,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:09,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:09,754 INFO L87 Difference]: Start difference. First operand 4327 states and 7440 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:09,930 INFO L93 Difference]: Finished difference Result 8733 states and 15020 transitions. [2025-02-05 22:02:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:09,956 INFO L225 Difference]: With dead ends: 8733 [2025-02-05 22:02:09,956 INFO L226 Difference]: Without dead ends: 4409 [2025-02-05 22:02:09,965 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:09,967 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 350 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:09,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2025-02-05 22:02:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 3579. [2025-02-05 22:02:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 3136 states have (on average 1.7098214285714286) internal successors, (5362), 3143 states have internal predecessors, (5362), 433 states have call successors, (433), 9 states have call predecessors, (433), 9 states have return successors, (433), 426 states have call predecessors, (433), 433 states have call successors, (433) [2025-02-05 22:02:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 6228 transitions. [2025-02-05 22:02:10,144 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 6228 transitions. Word has length 733 [2025-02-05 22:02:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:10,145 INFO L471 AbstractCegarLoop]: Abstraction has 3579 states and 6228 transitions. [2025-02-05 22:02:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 6228 transitions. [2025-02-05 22:02:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:10,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:10,157 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:02:10,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:10,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash 446547248, now seen corresponding path program 1 times [2025-02-05 22:02:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217649072] [2025-02-05 22:02:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:10,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:10,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:10,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:10,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:10,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217649072] [2025-02-05 22:02:10,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217649072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:10,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:10,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:10,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413075293] [2025-02-05 22:02:10,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:10,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:10,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:10,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:10,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:10,353 INFO L87 Difference]: Start difference. First operand 3579 states and 6228 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:10,552 INFO L93 Difference]: Finished difference Result 10244 states and 17797 transitions. [2025-02-05 22:02:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:10,576 INFO L225 Difference]: With dead ends: 10244 [2025-02-05 22:02:10,577 INFO L226 Difference]: Without dead ends: 6668 [2025-02-05 22:02:10,583 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:10,583 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 390 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:10,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1229 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2025-02-05 22:02:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6665. [2025-02-05 22:02:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 5816 states have (on average 1.6956671251719395) internal successors, (9862), 5831 states have internal predecessors, (9862), 830 states have call successors, (830), 18 states have call predecessors, (830), 18 states have return successors, (830), 815 states have call predecessors, (830), 830 states have call successors, (830) [2025-02-05 22:02:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 11522 transitions. [2025-02-05 22:02:10,783 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 11522 transitions. Word has length 733 [2025-02-05 22:02:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:10,783 INFO L471 AbstractCegarLoop]: Abstraction has 6665 states and 11522 transitions. [2025-02-05 22:02:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 11522 transitions. [2025-02-05 22:02:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:10,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:10,794 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:02:10,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:10,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1630662095, now seen corresponding path program 1 times [2025-02-05 22:02:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222082904] [2025-02-05 22:02:10,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:10,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:10,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:10,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222082904] [2025-02-05 22:02:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222082904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:11,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:11,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:11,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551776410] [2025-02-05 22:02:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:11,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:11,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:11,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:11,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:11,026 INFO L87 Difference]: Start difference. First operand 6665 states and 11522 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:11,418 INFO L93 Difference]: Finished difference Result 19797 states and 34176 transitions. [2025-02-05 22:02:11,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:11,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:11,465 INFO L225 Difference]: With dead ends: 19797 [2025-02-05 22:02:11,465 INFO L226 Difference]: Without dead ends: 13135 [2025-02-05 22:02:11,483 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:11,483 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 565 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:11,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1639 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2025-02-05 22:02:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 13133. [2025-02-05 22:02:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13133 states, 11436 states have (on average 1.6740118922700244) internal successors, (19144), 11466 states have internal predecessors, (19144), 1660 states have call successors, (1660), 36 states have call predecessors, (1660), 36 states have return successors, (1660), 1630 states have call predecessors, (1660), 1660 states have call successors, (1660) [2025-02-05 22:02:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13133 states to 13133 states and 22464 transitions. [2025-02-05 22:02:11,966 INFO L78 Accepts]: Start accepts. Automaton has 13133 states and 22464 transitions. Word has length 733 [2025-02-05 22:02:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:11,967 INFO L471 AbstractCegarLoop]: Abstraction has 13133 states and 22464 transitions. [2025-02-05 22:02:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13133 states and 22464 transitions. [2025-02-05 22:02:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:11,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:11,981 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:02:11,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:11,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -218222959, now seen corresponding path program 1 times [2025-02-05 22:02:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407857476] [2025-02-05 22:02:11,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:12,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:12,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:12,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:12,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407857476] [2025-02-05 22:02:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407857476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:12,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:12,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:02:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114827429] [2025-02-05 22:02:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:12,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:02:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:12,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:02:12,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:02:12,542 INFO L87 Difference]: Start difference. First operand 13133 states and 22464 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:13,949 INFO L93 Difference]: Finished difference Result 39389 states and 67378 transitions. [2025-02-05 22:02:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:02:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 733 [2025-02-05 22:02:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:14,026 INFO L225 Difference]: With dead ends: 39389 [2025-02-05 22:02:14,027 INFO L226 Difference]: Without dead ends: 26259 [2025-02-05 22:02:14,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:14,056 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1057 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:14,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 1215 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 22:02:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26259 states. [2025-02-05 22:02:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26259 to 26257. [2025-02-05 22:02:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26257 states, 22864 states have (on average 1.6707487753673897) internal successors, (38200), 22924 states have internal predecessors, (38200), 3320 states have call successors, (3320), 72 states have call predecessors, (3320), 72 states have return successors, (3320), 3260 states have call predecessors, (3320), 3320 states have call successors, (3320) [2025-02-05 22:02:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26257 states to 26257 states and 44840 transitions. [2025-02-05 22:02:15,150 INFO L78 Accepts]: Start accepts. Automaton has 26257 states and 44840 transitions. Word has length 733 [2025-02-05 22:02:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:15,151 INFO L471 AbstractCegarLoop]: Abstraction has 26257 states and 44840 transitions. [2025-02-05 22:02:15,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 22:02:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26257 states and 44840 transitions. [2025-02-05 22:02:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:15,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:15,176 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:02:15,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1636122578, now seen corresponding path program 1 times [2025-02-05 22:02:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730840432] [2025-02-05 22:02:15,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:15,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:15,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:17,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:17,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730840432] [2025-02-05 22:02:17,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730840432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:17,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:17,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:02:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461581668] [2025-02-05 22:02:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:02:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:02:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:02:17,964 INFO L87 Difference]: Start difference. First operand 26257 states and 44840 transitions. Second operand has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 22:02:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:31,470 INFO L93 Difference]: Finished difference Result 232207 states and 394226 transitions. [2025-02-05 22:02:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:02:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) Word has length 733 [2025-02-05 22:02:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:32,026 INFO L225 Difference]: With dead ends: 232207 [2025-02-05 22:02:32,026 INFO L226 Difference]: Without dead ends: 205953 [2025-02-05 22:02:32,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-02-05 22:02:32,329 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 6892 mSDsluCounter, 4699 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 2249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6892 SdHoareTripleChecker+Valid, 5482 SdHoareTripleChecker+Invalid, 5200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2249 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:32,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6892 Valid, 5482 Invalid, 5200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2249 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 22:02:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205953 states. [2025-02-05 22:02:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205953 to 142389. [2025-02-05 22:02:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142389 states, 122984 states have (on average 1.6589800299225916) internal successors, (204028), 123360 states have internal predecessors, (204028), 18904 states have call successors, (18904), 500 states have call predecessors, (18904), 500 states have return successors, (18904), 18528 states have call predecessors, (18904), 18904 states have call successors, (18904) [2025-02-05 22:02:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142389 states to 142389 states and 241836 transitions. [2025-02-05 22:02:40,968 INFO L78 Accepts]: Start accepts. Automaton has 142389 states and 241836 transitions. Word has length 733 [2025-02-05 22:02:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:40,969 INFO L471 AbstractCegarLoop]: Abstraction has 142389 states and 241836 transitions. [2025-02-05 22:02:40,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 22:02:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 142389 states and 241836 transitions. [2025-02-05 22:02:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-02-05 22:02:41,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:41,505 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:02:41,506 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:41,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1130563953, now seen corresponding path program 1 times [2025-02-05 22:02:41,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:41,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335225412] [2025-02-05 22:02:41,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:41,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:41,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-02-05 22:02:41,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-02-05 22:02:41,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:41,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 22:02:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335225412] [2025-02-05 22:02:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335225412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 22:02:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280927342] [2025-02-05 22:02:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:02:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:43,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:02:43,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:02:43,018 INFO L87 Difference]: Start difference. First operand 142389 states and 241836 transitions. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 8 states have internal predecessors, (166), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114)