./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-34.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-34.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 31a0f34f1361b8503e92d18ec6b5d54f94798b9bc08facd153f06fdbee00fcdf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:59,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:59,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:56:59,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:59,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:59,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:59,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:59,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:59,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:59,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:59,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:59,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:59,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:59,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:59,827 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:59,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:59,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:59,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:59,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:59,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:59,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:59,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:59,830 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 -> 31a0f34f1361b8503e92d18ec6b5d54f94798b9bc08facd153f06fdbee00fcdf [2025-02-05 21:56:59,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:57:00,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:57:00,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:57:00,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:57:00,009 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:57:00,011 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-34.i [2025-02-05 21:57:01,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a793b9f8c/e989074ad3fc48ef92e93e3366930682/FLAGb31afd748 [2025-02-05 21:57:01,549 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:57:01,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-34.i [2025-02-05 21:57:01,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a793b9f8c/e989074ad3fc48ef92e93e3366930682/FLAGb31afd748 [2025-02-05 21:57:01,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a793b9f8c/e989074ad3fc48ef92e93e3366930682 [2025-02-05 21:57:01,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:57:01,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:57:01,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:01,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:57:01,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:57:01,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:01" (1/1) ... [2025-02-05 21:57:01,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d44e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:01, skipping insertion in model container [2025-02-05 21:57:01,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:57:01" (1/1) ... [2025-02-05 21:57:01,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:57:01,939 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-34.i[916,929] [2025-02-05 21:57:02,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:02,068 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:57:02,084 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-34.i[916,929] [2025-02-05 21:57:02,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:57:02,182 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:57:02,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02 WrapperNode [2025-02-05 21:57:02,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:57:02,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:02,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:57:02,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:57:02,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,257 INFO L138 Inliner]: procedures = 26, calls = 122, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 985 [2025-02-05 21:57:02,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:57:02,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:57:02,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:57:02,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:57:02,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,296 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:57:02,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:57:02,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:57:02,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:57:02,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:57:02,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (1/1) ... [2025-02-05 21:57:02,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:57:02,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:02,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:57:02,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:57:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:57:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:57:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:57:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:57:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:57:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:57:02,501 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:57:02,502 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:57:03,440 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L749: havoc property_#t~bitwise89#1;havoc property_#t~ite91#1;havoc property_#t~bitwise90#1;havoc property_#t~short92#1; [2025-02-05 21:57:03,681 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-02-05 21:57:03,681 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:57:03,723 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:57:03,723 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 21:57:03,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:03 BoogieIcfgContainer [2025-02-05 21:57:03,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:57:03,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:57:03,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:57:03,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:57:03,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:57:01" (1/3) ... [2025-02-05 21:57:03,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fe2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:03, skipping insertion in model container [2025-02-05 21:57:03,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:57:02" (2/3) ... [2025-02-05 21:57:03,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161fe2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:57:03, skipping insertion in model container [2025-02-05 21:57:03,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:57:03" (3/3) ... [2025-02-05 21:57:03,733 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-34.i [2025-02-05 21:57:03,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:57:03,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-34.i that has 2 procedures, 410 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:57:03,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:57:03,808 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;@42276fce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:57:03,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:57:03,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 298 states have (on average 1.6174496644295302) internal successors, (482), 299 states have internal predecessors, (482), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 21:57:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:03,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:03,839 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:03,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:03,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash 515438278, now seen corresponding path program 1 times [2025-02-05 21:57:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117566358] [2025-02-05 21:57:03,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:03,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:04,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:04,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-02-05 21:57:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:04,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117566358] [2025-02-05 21:57:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117566358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:57:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245298511] [2025-02-05 21:57:04,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:57:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:57:04,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:57:04,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:57:04,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:04,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:57:04,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:57:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 23328 trivial. 0 not checked. [2025-02-05 21:57:04,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:57:04,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245298511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:04,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:57:04,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:57:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508405914] [2025-02-05 21:57:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:04,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:57:04,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:04,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:57:04,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:57:04,831 INFO L87 Difference]: Start difference. First operand has 410 states, 298 states have (on average 1.6174496644295302) internal successors, (482), 299 states have internal predecessors, (482), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-02-05 21:57:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:04,927 INFO L93 Difference]: Finished difference Result 814 states and 1504 transitions. [2025-02-05 21:57:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:57:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) Word has length 705 [2025-02-05 21:57:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:04,941 INFO L225 Difference]: With dead ends: 814 [2025-02-05 21:57:04,943 INFO L226 Difference]: Without dead ends: 407 [2025-02-05 21:57:04,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:57:04,955 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:04,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 669 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:57:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-05 21:57:05,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-02-05 21:57:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 296 states have (on average 1.6081081081081081) internal successors, (476), 296 states have internal predecessors, (476), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-02-05 21:57:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 694 transitions. [2025-02-05 21:57:05,073 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 694 transitions. Word has length 705 [2025-02-05 21:57:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:05,073 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 694 transitions. [2025-02-05 21:57:05,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (109), 2 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 2 states have call successors, (109) [2025-02-05 21:57:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 694 transitions. [2025-02-05 21:57:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:05,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:05,088 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:05,098 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 21:57:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:57:05,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:05,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 641432639, now seen corresponding path program 1 times [2025-02-05 21:57:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293077076] [2025-02-05 21:57:05,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:05,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293077076] [2025-02-05 21:57:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293077076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141941044] [2025-02-05 21:57:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:05,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:05,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:05,836 INFO L87 Difference]: Start difference. First operand 407 states and 694 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:05,937 INFO L93 Difference]: Finished difference Result 1074 states and 1842 transitions. [2025-02-05 21:57:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:05,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:05,943 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 21:57:05,944 INFO L226 Difference]: Without dead ends: 670 [2025-02-05 21:57:05,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:05,945 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 448 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:05,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1390 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-02-05 21:57:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 667. [2025-02-05 21:57:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 536 states have (on average 1.6585820895522387) internal successors, (889), 537 states have internal predecessors, (889), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:57:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1145 transitions. [2025-02-05 21:57:05,994 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1145 transitions. Word has length 705 [2025-02-05 21:57:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 1145 transitions. [2025-02-05 21:57:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1145 transitions. [2025-02-05 21:57:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:06,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:06,021 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:06,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:57:06,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:06,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2028797599, now seen corresponding path program 1 times [2025-02-05 21:57:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774615936] [2025-02-05 21:57:06,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:06,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:06,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:06,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:06,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774615936] [2025-02-05 21:57:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774615936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130192281] [2025-02-05 21:57:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:06,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:06,374 INFO L87 Difference]: Start difference. First operand 667 states and 1145 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:06,494 INFO L93 Difference]: Finished difference Result 1827 states and 3149 transitions. [2025-02-05 21:57:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:06,505 INFO L225 Difference]: With dead ends: 1827 [2025-02-05 21:57:06,506 INFO L226 Difference]: Without dead ends: 1163 [2025-02-05 21:57:06,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:06,509 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 432 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:06,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1372 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2025-02-05 21:57:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1159. [2025-02-05 21:57:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 996 states have (on average 1.6827309236947792) internal successors, (1676), 999 states have internal predecessors, (1676), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 155 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-05 21:57:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1992 transitions. [2025-02-05 21:57:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1992 transitions. Word has length 705 [2025-02-05 21:57:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:06,594 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1992 transitions. [2025-02-05 21:57:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1992 transitions. [2025-02-05 21:57:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:06,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:06,603 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:57:06,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1682101762, now seen corresponding path program 1 times [2025-02-05 21:57:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312583044] [2025-02-05 21:57:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:06,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:06,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:06,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312583044] [2025-02-05 21:57:06,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312583044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:06,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385005951] [2025-02-05 21:57:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:06,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:06,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:06,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:06,888 INFO L87 Difference]: Start difference. First operand 1159 states and 1992 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:07,019 INFO L93 Difference]: Finished difference Result 3443 states and 5920 transitions. [2025-02-05 21:57:07,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:07,031 INFO L225 Difference]: With dead ends: 3443 [2025-02-05 21:57:07,031 INFO L226 Difference]: Without dead ends: 2287 [2025-02-05 21:57:07,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:07,035 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 649 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:07,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1711 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-02-05 21:57:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2285. [2025-02-05 21:57:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 1960 states have (on average 1.6724489795918367) internal successors, (3278), 1966 states have internal predecessors, (3278), 316 states have call successors, (316), 8 states have call predecessors, (316), 8 states have return successors, (316), 310 states have call predecessors, (316), 316 states have call successors, (316) [2025-02-05 21:57:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3910 transitions. [2025-02-05 21:57:07,165 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3910 transitions. Word has length 705 [2025-02-05 21:57:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:07,166 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3910 transitions. [2025-02-05 21:57:07,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3910 transitions. [2025-02-05 21:57:07,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:07,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:07,173 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:57:07,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1829486559, now seen corresponding path program 1 times [2025-02-05 21:57:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185255019] [2025-02-05 21:57:07,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:07,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:07,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:07,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:07,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185255019] [2025-02-05 21:57:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185255019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:07,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:07,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962244596] [2025-02-05 21:57:07,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:07,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:07,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:07,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:07,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:07,604 INFO L87 Difference]: Start difference. First operand 2285 states and 3910 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:07,849 INFO L93 Difference]: Finished difference Result 5500 states and 9382 transitions. [2025-02-05 21:57:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:07,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:07,881 INFO L225 Difference]: With dead ends: 5500 [2025-02-05 21:57:07,886 INFO L226 Difference]: Without dead ends: 3218 [2025-02-05 21:57:07,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:07,900 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 456 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:07,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1275 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2025-02-05 21:57:08,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3196. [2025-02-05 21:57:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 2628 states have (on average 1.647640791476408) internal successors, (4330), 2635 states have internal predecessors, (4330), 553 states have call successors, (553), 14 states have call predecessors, (553), 14 states have return successors, (553), 546 states have call predecessors, (553), 553 states have call successors, (553) [2025-02-05 21:57:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 5436 transitions. [2025-02-05 21:57:08,214 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 5436 transitions. Word has length 705 [2025-02-05 21:57:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:08,215 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 5436 transitions. [2025-02-05 21:57:08,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 5436 transitions. [2025-02-05 21:57:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:08,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:08,222 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:08,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:57:08,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:08,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:08,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1705413312, now seen corresponding path program 1 times [2025-02-05 21:57:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445727517] [2025-02-05 21:57:08,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:08,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:08,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:08,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445727517] [2025-02-05 21:57:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445727517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929638742] [2025-02-05 21:57:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:08,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:08,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:08,450 INFO L87 Difference]: Start difference. First operand 3196 states and 5436 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:08,614 INFO L93 Difference]: Finished difference Result 6456 states and 10980 transitions. [2025-02-05 21:57:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:08,630 INFO L225 Difference]: With dead ends: 6456 [2025-02-05 21:57:08,630 INFO L226 Difference]: Without dead ends: 3293 [2025-02-05 21:57:08,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:08,637 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 626 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:08,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1504 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2025-02-05 21:57:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3291. [2025-02-05 21:57:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 2723 states have (on average 1.6375321336760926) internal successors, (4459), 2730 states have internal predecessors, (4459), 553 states have call successors, (553), 14 states have call predecessors, (553), 14 states have return successors, (553), 546 states have call predecessors, (553), 553 states have call successors, (553) [2025-02-05 21:57:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 5565 transitions. [2025-02-05 21:57:08,830 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 5565 transitions. Word has length 705 [2025-02-05 21:57:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:08,830 INFO L471 AbstractCegarLoop]: Abstraction has 3291 states and 5565 transitions. [2025-02-05 21:57:08,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 5565 transitions. [2025-02-05 21:57:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:08,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:08,837 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:08,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:57:08,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2102071390, now seen corresponding path program 1 times [2025-02-05 21:57:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021891691] [2025-02-05 21:57:08,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:08,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:09,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021891691] [2025-02-05 21:57:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021891691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:09,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:09,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:09,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827450856] [2025-02-05 21:57:09,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:09,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:09,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:09,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:09,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:09,065 INFO L87 Difference]: Start difference. First operand 3291 states and 5565 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:09,234 INFO L93 Difference]: Finished difference Result 8514 states and 14374 transitions. [2025-02-05 21:57:09,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:09,260 INFO L225 Difference]: With dead ends: 8514 [2025-02-05 21:57:09,260 INFO L226 Difference]: Without dead ends: 5256 [2025-02-05 21:57:09,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:09,270 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 329 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:09,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 1428 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:09,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2025-02-05 21:57:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5250. [2025-02-05 21:57:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 4418 states have (on average 1.6387505658669081) internal successors, (7240), 4435 states have internal predecessors, (7240), 803 states have call successors, (803), 28 states have call predecessors, (803), 28 states have return successors, (803), 786 states have call predecessors, (803), 803 states have call successors, (803) [2025-02-05 21:57:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 8846 transitions. [2025-02-05 21:57:09,604 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 8846 transitions. Word has length 705 [2025-02-05 21:57:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:09,605 INFO L471 AbstractCegarLoop]: Abstraction has 5250 states and 8846 transitions. [2025-02-05 21:57:09,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 8846 transitions. [2025-02-05 21:57:09,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:09,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:09,624 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:57:09,624 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 857306909, now seen corresponding path program 1 times [2025-02-05 21:57:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708353348] [2025-02-05 21:57:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:09,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708353348] [2025-02-05 21:57:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708353348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:10,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103037668] [2025-02-05 21:57:10,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:10,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:10,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:10,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:10,188 INFO L87 Difference]: Start difference. First operand 5250 states and 8846 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:10,671 INFO L93 Difference]: Finished difference Result 15141 states and 25394 transitions. [2025-02-05 21:57:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:10,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:10,710 INFO L225 Difference]: With dead ends: 15141 [2025-02-05 21:57:10,710 INFO L226 Difference]: Without dead ends: 9924 [2025-02-05 21:57:10,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:10,724 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 891 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:10,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 2119 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:57:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9924 states. [2025-02-05 21:57:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9924 to 9856. [2025-02-05 21:57:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9856 states, 8206 states have (on average 1.6217401901048014) internal successors, (13308), 8241 states have internal predecessors, (13308), 1577 states have call successors, (1577), 72 states have call predecessors, (1577), 72 states have return successors, (1577), 1542 states have call predecessors, (1577), 1577 states have call successors, (1577) [2025-02-05 21:57:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9856 states to 9856 states and 16462 transitions. [2025-02-05 21:57:11,175 INFO L78 Accepts]: Start accepts. Automaton has 9856 states and 16462 transitions. Word has length 705 [2025-02-05 21:57:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:11,175 INFO L471 AbstractCegarLoop]: Abstraction has 9856 states and 16462 transitions. [2025-02-05 21:57:11,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 9856 states and 16462 transitions. [2025-02-05 21:57:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:11,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:11,187 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:11,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:57:11,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:11,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:11,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1656160452, now seen corresponding path program 1 times [2025-02-05 21:57:11,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327547601] [2025-02-05 21:57:11,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:11,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:11,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:11,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:11,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:11,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327547601] [2025-02-05 21:57:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327547601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167721177] [2025-02-05 21:57:11,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:11,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:11,638 INFO L87 Difference]: Start difference. First operand 9856 states and 16462 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:12,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:12,011 INFO L93 Difference]: Finished difference Result 29457 states and 49201 transitions. [2025-02-05 21:57:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:12,157 INFO L225 Difference]: With dead ends: 29457 [2025-02-05 21:57:12,157 INFO L226 Difference]: Without dead ends: 19634 [2025-02-05 21:57:12,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:12,196 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 657 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:12,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1330 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2025-02-05 21:57:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 19512. [2025-02-05 21:57:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19512 states, 16232 states have (on average 1.6195170034499753) internal successors, (26288), 16301 states have internal predecessors, (26288), 3135 states have call successors, (3135), 144 states have call predecessors, (3135), 144 states have return successors, (3135), 3066 states have call predecessors, (3135), 3135 states have call successors, (3135) [2025-02-05 21:57:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19512 states to 19512 states and 32558 transitions. [2025-02-05 21:57:13,132 INFO L78 Accepts]: Start accepts. Automaton has 19512 states and 32558 transitions. Word has length 705 [2025-02-05 21:57:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:13,133 INFO L471 AbstractCegarLoop]: Abstraction has 19512 states and 32558 transitions. [2025-02-05 21:57:13,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19512 states and 32558 transitions. [2025-02-05 21:57:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:13,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:13,153 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:57:13,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:13,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1375810563, now seen corresponding path program 1 times [2025-02-05 21:57:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704543352] [2025-02-05 21:57:13,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:13,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:13,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:13,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:13,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:13,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704543352] [2025-02-05 21:57:13,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704543352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:13,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:57:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396774472] [2025-02-05 21:57:13,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:57:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:13,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:57:13,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:13,726 INFO L87 Difference]: Start difference. First operand 19512 states and 32558 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:14,474 INFO L93 Difference]: Finished difference Result 58470 states and 97570 transitions. [2025-02-05 21:57:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:14,588 INFO L225 Difference]: With dead ends: 58470 [2025-02-05 21:57:14,588 INFO L226 Difference]: Without dead ends: 38991 [2025-02-05 21:57:14,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:14,636 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 443 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:14,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1331 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38991 states. [2025-02-05 21:57:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38991 to 38989. [2025-02-05 21:57:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38989 states, 32449 states have (on average 1.6161052728897656) internal successors, (52441), 32586 states have internal predecessors, (52441), 6251 states have call successors, (6251), 288 states have call predecessors, (6251), 288 states have return successors, (6251), 6114 states have call predecessors, (6251), 6251 states have call successors, (6251) [2025-02-05 21:57:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38989 states to 38989 states and 64943 transitions. [2025-02-05 21:57:16,359 INFO L78 Accepts]: Start accepts. Automaton has 38989 states and 64943 transitions. Word has length 705 [2025-02-05 21:57:16,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:16,361 INFO L471 AbstractCegarLoop]: Abstraction has 38989 states and 64943 transitions. [2025-02-05 21:57:16,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 38989 states and 64943 transitions. [2025-02-05 21:57:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:57:16,403 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:16,403 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:57:16,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:16,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 881100444, now seen corresponding path program 1 times [2025-02-05 21:57:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422117875] [2025-02-05 21:57:16,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:16,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:16,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:57:16,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:57:16,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:16,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422117875] [2025-02-05 21:57:16,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422117875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242268969] [2025-02-05 21:57:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:16,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:16,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:16,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:16,960 INFO L87 Difference]: Start difference. First operand 38989 states and 64943 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:18,904 INFO L93 Difference]: Finished difference Result 121383 states and 201766 transitions. [2025-02-05 21:57:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:18,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 705 [2025-02-05 21:57:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:19,162 INFO L225 Difference]: With dead ends: 121383 [2025-02-05 21:57:19,163 INFO L226 Difference]: Without dead ends: 82427 [2025-02-05 21:57:19,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:19,247 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 800 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:19,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 2023 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:57:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82427 states. [2025-02-05 21:57:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82427 to 78263. [2025-02-05 21:57:23,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78263 states, 65203 states have (on average 1.6107694431237827) internal successors, (105027), 65476 states have internal predecessors, (105027), 12483 states have call successors, (12483), 576 states have call predecessors, (12483), 576 states have return successors, (12483), 12210 states have call predecessors, (12483), 12483 states have call successors, (12483) [2025-02-05 21:57:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78263 states to 78263 states and 129993 transitions. [2025-02-05 21:57:23,348 INFO L78 Accepts]: Start accepts. Automaton has 78263 states and 129993 transitions. Word has length 705 [2025-02-05 21:57:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:23,349 INFO L471 AbstractCegarLoop]: Abstraction has 78263 states and 129993 transitions. [2025-02-05 21:57:23,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 78263 states and 129993 transitions. [2025-02-05 21:57:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:57:23,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:23,389 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:23,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:57:23,389 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:23,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 687475907, now seen corresponding path program 1 times [2025-02-05 21:57:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:23,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080250887] [2025-02-05 21:57:23,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:23,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:23,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:57:23,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:57:23,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:23,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080250887] [2025-02-05 21:57:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080250887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:24,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:57:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652592812] [2025-02-05 21:57:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:24,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:57:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:24,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:57:24,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:57:24,199 INFO L87 Difference]: Start difference. First operand 78263 states and 129993 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:28,054 INFO L93 Difference]: Finished difference Result 233763 states and 387955 transitions. [2025-02-05 21:57:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:57:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) Word has length 706 [2025-02-05 21:57:28,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:28,653 INFO L225 Difference]: With dead ends: 233763 [2025-02-05 21:57:28,654 INFO L226 Difference]: Without dead ends: 155533 [2025-02-05 21:57:28,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:57:28,757 INFO L435 NwaCegarLoop]: 1312 mSDtfsCounter, 901 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:28,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2860 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:57:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155533 states. [2025-02-05 21:57:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155533 to 79377. [2025-02-05 21:57:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79377 states, 66076 states have (on average 1.6032447484714571) internal successors, (105936), 66353 states have internal predecessors, (105936), 12712 states have call successors, (12712), 588 states have call predecessors, (12712), 588 states have return successors, (12712), 12435 states have call predecessors, (12712), 12712 states have call successors, (12712) [2025-02-05 21:57:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79377 states to 79377 states and 131360 transitions. [2025-02-05 21:57:33,154 INFO L78 Accepts]: Start accepts. Automaton has 79377 states and 131360 transitions. Word has length 706 [2025-02-05 21:57:33,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:33,159 INFO L471 AbstractCegarLoop]: Abstraction has 79377 states and 131360 transitions. [2025-02-05 21:57:33,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109) [2025-02-05 21:57:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 79377 states and 131360 transitions. [2025-02-05 21:57:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 21:57:33,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:33,223 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:57:33,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:57:33,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash -100948712, now seen corresponding path program 1 times [2025-02-05 21:57:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808937660] [2025-02-05 21:57:33,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:33,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:57:33,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:57:33,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:33,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23544 trivial. 0 not checked. [2025-02-05 21:57:33,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:33,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808937660] [2025-02-05 21:57:33,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808937660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:33,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:33,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498443384] [2025-02-05 21:57:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:33,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:33,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:33,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:33,908 INFO L87 Difference]: Start difference. First operand 79377 states and 131360 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 1 states have call predecessors, (109), 1 states have call successors, (109)