./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e9b96b0741a733a51a6fdc98febea53c17ee0aff8e35bf5e7374f763c086dc39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:42:09,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:42:09,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:42:09,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:42:09,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:42:09,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:42:09,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:42:09,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:42:09,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:42:09,751 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:42:09,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:42:09,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:42:09,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:42:09,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:42:09,752 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:42:09,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:42:09,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:42:09,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:42:09,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:42:09,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:42:09,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:42:09,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:42:09,757 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/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 -> e9b96b0741a733a51a6fdc98febea53c17ee0aff8e35bf5e7374f763c086dc39 [2025-03-16 23:42:10,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:42:10,018 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:42:10,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:42:10,022 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:42:10,022 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:42:10,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i [2025-03-16 23:42:11,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af3d621/8a3d5e13b1a64075b56500e021ef91ec/FLAGdce6b76d6 [2025-03-16 23:42:11,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:42:11,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i [2025-03-16 23:42:11,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af3d621/8a3d5e13b1a64075b56500e021ef91ec/FLAGdce6b76d6 [2025-03-16 23:42:11,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1af3d621/8a3d5e13b1a64075b56500e021ef91ec [2025-03-16 23:42:11,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:42:11,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:42:11,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:42:11,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:42:11,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:42:11,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:42:11" (1/1) ... [2025-03-16 23:42:11,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef9a0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:11, skipping insertion in model container [2025-03-16 23:42:11,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:42:11" (1/1) ... [2025-03-16 23:42:11,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:42:11,931 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i[916,929] [2025-03-16 23:42:12,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:42:12,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:42:12,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-31.i[916,929] [2025-03-16 23:42:12,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:42:12,107 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:42:12,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12 WrapperNode [2025-03-16 23:42:12,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:42:12,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:42:12,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:42:12,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:42:12,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,171 INFO L138 Inliner]: procedures = 26, calls = 78, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 339 [2025-03-16 23:42:12,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:42:12,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:42:12,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:42:12,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:42:12,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,196 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-03-16 23:42:12,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,206 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:42:12,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:42:12,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:42:12,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:42:12,224 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (1/1) ... [2025-03-16 23:42:12,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:42:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:42:12,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:42:12,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:42:12,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:42:12,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:42:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:42:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:42:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:42:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:42:12,356 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:42:12,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:42:12,765 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:42:12,766 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:42:12,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:42:12,778 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:42:12,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:42:12 BoogieIcfgContainer [2025-03-16 23:42:12,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:42:12,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:42:12,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:42:12,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:42:12,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:42:11" (1/3) ... [2025-03-16 23:42:12,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b354883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:42:12, skipping insertion in model container [2025-03-16 23:42:12,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:42:12" (2/3) ... [2025-03-16 23:42:12,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b354883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:42:12, skipping insertion in model container [2025-03-16 23:42:12,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:42:12" (3/3) ... [2025-03-16 23:42:12,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-31.i [2025-03-16 23:42:12,798 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:42:12,800 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-31.i that has 2 procedures, 146 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:42:12,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:42:12,872 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;@6d57fbda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:42:12,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:42:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 79 states have internal predecessors, (110), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 23:42:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 23:42:12,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:12,893 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:12,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -715245619, now seen corresponding path program 1 times [2025-03-16 23:42:12,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850327076] [2025-03-16 23:42:12,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:12,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 23:42:13,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 23:42:13,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:13,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-16 23:42:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850327076] [2025-03-16 23:42:13,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850327076] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:42:13,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625112563] [2025-03-16 23:42:13,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:42:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:42:13,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:42:13,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:42:13,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 23:42:13,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 23:42:13,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:13,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:42:13,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:42:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8192 trivial. 0 not checked. [2025-03-16 23:42:13,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:42:13,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625112563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:13,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:42:13,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:42:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453621359] [2025-03-16 23:42:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:13,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:42:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:13,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:42:13,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:42:13,599 INFO L87 Difference]: Start difference. First operand has 146 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 79 states have internal predecessors, (110), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-16 23:42:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:13,643 INFO L93 Difference]: Finished difference Result 289 states and 543 transitions. [2025-03-16 23:42:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:42:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) Word has length 386 [2025-03-16 23:42:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:13,650 INFO L225 Difference]: With dead ends: 289 [2025-03-16 23:42:13,651 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 23:42:13,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 387 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-03-16 23:42:13,658 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:42:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 23:42:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-16 23:42:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 23:42:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 235 transitions. [2025-03-16 23:42:13,717 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 235 transitions. Word has length 386 [2025-03-16 23:42:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:13,717 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 235 transitions. [2025-03-16 23:42:13,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (65), 2 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-16 23:42:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 235 transitions. [2025-03-16 23:42:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 23:42:13,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:13,727 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:13,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:42:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:42:13,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:13,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:13,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1805540912, now seen corresponding path program 1 times [2025-03-16 23:42:13,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:13,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496686516] [2025-03-16 23:42:13,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:13,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 23:42:14,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 23:42:14,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:14,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:14,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:14,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496686516] [2025-03-16 23:42:14,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496686516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:14,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:14,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:42:14,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819096974] [2025-03-16 23:42:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:14,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:42:14,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:14,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:42:14,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:42:14,307 INFO L87 Difference]: Start difference. First operand 144 states and 235 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:14,396 INFO L93 Difference]: Finished difference Result 429 states and 701 transitions. [2025-03-16 23:42:14,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:42:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 386 [2025-03-16 23:42:14,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:14,403 INFO L225 Difference]: With dead ends: 429 [2025-03-16 23:42:14,405 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 23:42:14,406 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-03-16 23:42:14,407 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 225 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:14,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 679 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:42:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 23:42:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 148. [2025-03-16 23:42:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 65 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 23:42:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 240 transitions. [2025-03-16 23:42:14,442 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 240 transitions. Word has length 386 [2025-03-16 23:42:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:14,445 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 240 transitions. [2025-03-16 23:42:14,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2025-03-16 23:42:14,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 23:42:14,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:14,450 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:42:14,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1601922703, now seen corresponding path program 1 times [2025-03-16 23:42:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646959694] [2025-03-16 23:42:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:14,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 23:42:14,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 23:42:14,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:14,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:19,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646959694] [2025-03-16 23:42:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646959694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:19,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:19,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 23:42:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376925874] [2025-03-16 23:42:19,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:19,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 23:42:19,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:19,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 23:42:19,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-16 23:42:19,996 INFO L87 Difference]: Start difference. First operand 148 states and 240 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:20,480 INFO L93 Difference]: Finished difference Result 382 states and 590 transitions. [2025-03-16 23:42:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:42:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 386 [2025-03-16 23:42:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:20,483 INFO L225 Difference]: With dead ends: 382 [2025-03-16 23:42:20,483 INFO L226 Difference]: Without dead ends: 235 [2025-03-16 23:42:20,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:20,485 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 161 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:20,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 750 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:42:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-16 23:42:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 189. [2025-03-16 23:42:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 114 states have (on average 1.368421052631579) internal successors, (156), 116 states have internal predecessors, (156), 71 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-16 23:42:20,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 298 transitions. [2025-03-16 23:42:20,520 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 298 transitions. Word has length 386 [2025-03-16 23:42:20,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:20,521 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 298 transitions. [2025-03-16 23:42:20,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 298 transitions. [2025-03-16 23:42:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:20,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:20,525 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:20,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:42:20,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1833447273, now seen corresponding path program 1 times [2025-03-16 23:42:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639051503] [2025-03-16 23:42:20,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:20,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:20,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:20,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:20,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:27,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639051503] [2025-03-16 23:42:27,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639051503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:27,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:27,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:42:27,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005868626] [2025-03-16 23:42:27,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:27,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:42:27,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:27,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:42:27,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:27,697 INFO L87 Difference]: Start difference. First operand 189 states and 298 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:28,627 INFO L93 Difference]: Finished difference Result 455 states and 688 transitions. [2025-03-16 23:42:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:42:28,629 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:28,631 INFO L225 Difference]: With dead ends: 455 [2025-03-16 23:42:28,631 INFO L226 Difference]: Without dead ends: 273 [2025-03-16 23:42:28,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:42:28,633 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 180 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:28,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1184 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 23:42:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-16 23:42:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 172. [2025-03-16 23:42:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 100 states have internal predecessors, (133), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 23:42:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 271 transitions. [2025-03-16 23:42:28,656 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 271 transitions. Word has length 387 [2025-03-16 23:42:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:28,657 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 271 transitions. [2025-03-16 23:42:28,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 271 transitions. [2025-03-16 23:42:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:28,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:28,659 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:28,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:42:28,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:28,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:28,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2029960778, now seen corresponding path program 1 times [2025-03-16 23:42:28,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:28,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94050326] [2025-03-16 23:42:28,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:28,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:28,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:28,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:40,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:40,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94050326] [2025-03-16 23:42:40,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94050326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:40,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:40,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:42:40,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285803866] [2025-03-16 23:42:40,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:40,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:42:40,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:40,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:42:40,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:40,155 INFO L87 Difference]: Start difference. First operand 172 states and 271 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:41,368 INFO L93 Difference]: Finished difference Result 446 states and 673 transitions. [2025-03-16 23:42:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:42:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:41,372 INFO L225 Difference]: With dead ends: 446 [2025-03-16 23:42:41,372 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 23:42:41,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:42:41,374 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 153 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:41,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1261 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 23:42:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 23:42:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 170. [2025-03-16 23:42:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 98 states have internal predecessors, (130), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 23:42:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 268 transitions. [2025-03-16 23:42:41,393 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 268 transitions. Word has length 387 [2025-03-16 23:42:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:41,394 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 268 transitions. [2025-03-16 23:42:41,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 268 transitions. [2025-03-16 23:42:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:41,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:41,397 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:42:41,398 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:41,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash 138148692, now seen corresponding path program 1 times [2025-03-16 23:42:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:41,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747280402] [2025-03-16 23:42:41,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:41,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:41,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:41,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:44,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747280402] [2025-03-16 23:42:44,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747280402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:44,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:42:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628081650] [2025-03-16 23:42:44,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:44,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:42:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:44,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:42:44,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:44,957 INFO L87 Difference]: Start difference. First operand 170 states and 268 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:45,496 INFO L93 Difference]: Finished difference Result 247 states and 364 transitions. [2025-03-16 23:42:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:42:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:45,498 INFO L225 Difference]: With dead ends: 247 [2025-03-16 23:42:45,498 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 23:42:45,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:42:45,499 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 137 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:45,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 755 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:42:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 23:42:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 176. [2025-03-16 23:42:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 104 states have internal predecessors, (139), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 23:42:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 277 transitions. [2025-03-16 23:42:45,518 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 277 transitions. Word has length 387 [2025-03-16 23:42:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:45,518 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 277 transitions. [2025-03-16 23:42:45,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 277 transitions. [2025-03-16 23:42:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:45,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:45,520 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:45,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 23:42:45,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:45,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash 138178483, now seen corresponding path program 1 times [2025-03-16 23:42:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036173586] [2025-03-16 23:42:45,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:45,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:45,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:45,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:45,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:48,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:48,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036173586] [2025-03-16 23:42:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036173586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:42:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836666326] [2025-03-16 23:42:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:48,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:42:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:48,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:42:48,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:48,523 INFO L87 Difference]: Start difference. First operand 176 states and 277 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:48,990 INFO L93 Difference]: Finished difference Result 245 states and 362 transitions. [2025-03-16 23:42:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:42:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:48,993 INFO L225 Difference]: With dead ends: 245 [2025-03-16 23:42:48,993 INFO L226 Difference]: Without dead ends: 243 [2025-03-16 23:42:48,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:42:48,993 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 159 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:48,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 742 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:42:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-16 23:42:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2025-03-16 23:42:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 105 states have internal predecessors, (141), 69 states have call successors, (69), 3 states have call predecessors, (69), 3 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 23:42:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 279 transitions. [2025-03-16 23:42:49,010 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 279 transitions. Word has length 387 [2025-03-16 23:42:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 279 transitions. [2025-03-16 23:42:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 279 transitions. [2025-03-16 23:42:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:49,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:49,013 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 23:42:49,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:49,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:49,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1880988818, now seen corresponding path program 1 times [2025-03-16 23:42:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:49,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638140737] [2025-03-16 23:42:49,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:49,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638140737] [2025-03-16 23:42:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638140737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:49,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:42:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319402344] [2025-03-16 23:42:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:49,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:42:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:49,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:42:49,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:42:49,146 INFO L87 Difference]: Start difference. First operand 177 states and 279 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:49,311 INFO L93 Difference]: Finished difference Result 495 states and 779 transitions. [2025-03-16 23:42:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:42:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:49,319 INFO L225 Difference]: With dead ends: 495 [2025-03-16 23:42:49,319 INFO L226 Difference]: Without dead ends: 325 [2025-03-16 23:42:49,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:42:49,321 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 223 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:49,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 553 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:42:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-16 23:42:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 294. [2025-03-16 23:42:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 153 states have (on average 1.2222222222222223) internal successors, (187), 155 states have internal predecessors, (187), 134 states have call successors, (134), 6 states have call predecessors, (134), 6 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-16 23:42:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 455 transitions. [2025-03-16 23:42:49,361 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 455 transitions. Word has length 387 [2025-03-16 23:42:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:49,362 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 455 transitions. [2025-03-16 23:42:49,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 455 transitions. [2025-03-16 23:42:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:49,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:49,364 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:49,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 23:42:49,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:49,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:49,365 INFO L85 PathProgramCache]: Analyzing trace with hash 335373330, now seen corresponding path program 1 times [2025-03-16 23:42:49,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:49,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427265863] [2025-03-16 23:42:49,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:49,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:49,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:49,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:49,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:49,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:42:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8320 trivial. 0 not checked. [2025-03-16 23:42:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:42:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427265863] [2025-03-16 23:42:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427265863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:42:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:42:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 23:42:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655421906] [2025-03-16 23:42:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:42:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:42:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:42:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:42:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:42:52,738 INFO L87 Difference]: Start difference. First operand 294 states and 455 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:42:53,418 INFO L93 Difference]: Finished difference Result 370 states and 543 transitions. [2025-03-16 23:42:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:42:53,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) Word has length 387 [2025-03-16 23:42:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:42:53,422 INFO L225 Difference]: With dead ends: 370 [2025-03-16 23:42:53,422 INFO L226 Difference]: Without dead ends: 368 [2025-03-16 23:42:53,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-16 23:42:53,425 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 108 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:42:53,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1135 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 23:42:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-16 23:42:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 296. [2025-03-16 23:42:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 157 states have internal predecessors, (190), 134 states have call successors, (134), 6 states have call predecessors, (134), 6 states have return successors, (134), 132 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-16 23:42:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 458 transitions. [2025-03-16 23:42:53,469 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 458 transitions. Word has length 387 [2025-03-16 23:42:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:42:53,470 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 458 transitions. [2025-03-16 23:42:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (65), 1 states have call predecessors, (65), 1 states have return successors, (65), 1 states have call predecessors, (65), 1 states have call successors, (65) [2025-03-16 23:42:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 458 transitions. [2025-03-16 23:42:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-16 23:42:53,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:42:53,472 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 23:42:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 23:42:53,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:42:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:42:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash 116379671, now seen corresponding path program 1 times [2025-03-16 23:42:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:42:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142145368] [2025-03-16 23:42:53,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:42:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:42:53,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-16 23:42:53,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-16 23:42:53,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:42:53,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat