./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-500_file-21.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 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:06:11,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:06:11,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:06:11,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:06:11,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:06:11,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:06:11,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:06:11,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:06:11,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:06:11,246 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:06:11,247 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:06:11,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:06:11,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:06:11,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:06:11,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:06:11,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:06:11,249 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:06:11,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:11,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:06:11,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:06:11,250 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 -> 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f [2025-03-03 20:06:11,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:06:11,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:06:11,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:06:11,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:06:11,490 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:06:11,491 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-500_file-21.i [2025-03-03 20:06:12,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918b5fa37/b611c2e7a6e04b3bafd377460c4fc6f3/FLAG9039ad008 [2025-03-03 20:06:12,958 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:06:12,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-03-03 20:06:12,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918b5fa37/b611c2e7a6e04b3bafd377460c4fc6f3/FLAG9039ad008 [2025-03-03 20:06:13,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/918b5fa37/b611c2e7a6e04b3bafd377460c4fc6f3 [2025-03-03 20:06:13,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:06:13,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:06:13,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:13,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:06:13,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:06:13,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af383e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13, skipping insertion in model container [2025-03-03 20:06:13,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:06:13,374 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-500_file-21.i[916,929] [2025-03-03 20:06:13,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:13,515 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:06:13,522 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-500_file-21.i[916,929] [2025-03-03 20:06:13,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:06:13,597 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:06:13,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13 WrapperNode [2025-03-03 20:06:13,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:06:13,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:13,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:06:13,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:06:13,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,688 INFO L138 Inliner]: procedures = 26, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 848 [2025-03-03 20:06:13,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:06:13,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:06:13,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:06:13,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:06:13,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,751 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-03 20:06:13,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:06:13,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:06:13,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:06:13,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:06:13,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (1/1) ... [2025-03-03 20:06:13,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:06:13,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:13,846 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-03 20:06:13,850 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-03 20:06:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:06:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:06:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:06:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:06:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:06:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:06:13,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:06:13,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:06:14,791 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc property_#t~ite79#1;havoc property_#t~bitwise78#1;havoc property_#t~short80#1; [2025-03-03 20:06:14,975 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 20:06:14,975 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:06:15,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:06:15,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:06:15,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:15 BoogieIcfgContainer [2025-03-03 20:06:15,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:06:15,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:06:15,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:06:15,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:06:15,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:06:13" (1/3) ... [2025-03-03 20:06:15,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebb2ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:15, skipping insertion in model container [2025-03-03 20:06:15,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:06:13" (2/3) ... [2025-03-03 20:06:15,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebb2ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:06:15, skipping insertion in model container [2025-03-03 20:06:15,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:06:15" (3/3) ... [2025-03-03 20:06:15,024 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-03-03 20:06:15,034 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:06:15,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:06:15,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:06:15,098 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;@646a6414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:06:15,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:06:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 20:06:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-03 20:06:15,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:15,137 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:15,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2018403777, now seen corresponding path program 1 times [2025-03-03 20:06:15,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019216988] [2025-03-03 20:06:15,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:15,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-03 20:06:15,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-03 20:06:15,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:15,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 206 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-03-03 20:06:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:15,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019216988] [2025-03-03 20:06:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019216988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:06:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589944536] [2025-03-03 20:06:15,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:06:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:06:15,711 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-03 20:06:15,713 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-03 20:06:15,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-03 20:06:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-03 20:06:16,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:16,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1539 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:06:16,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-03-03 20:06:16,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:06:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589944536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:06:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:06:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391214796] [2025-03-03 20:06:16,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:16,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:06:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:16,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:06:16,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:06:16,187 INFO L87 Difference]: Start difference. First operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:16,254 INFO L93 Difference]: Finished difference Result 686 states and 1279 transitions. [2025-03-03 20:06:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:06:16,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-03-03 20:06:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:16,263 INFO L225 Difference]: With dead ends: 686 [2025-03-03 20:06:16,263 INFO L226 Difference]: Without dead ends: 343 [2025-03-03 20:06:16,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 670 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-03 20:06:16,274 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:16,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-03 20:06:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-03 20:06:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 237 states have (on average 1.590717299578059) internal successors, (377), 237 states have internal predecessors, (377), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-03 20:06:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 585 transitions. [2025-03-03 20:06:16,364 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 585 transitions. Word has length 669 [2025-03-03 20:06:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:16,365 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 585 transitions. [2025-03-03 20:06:16,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 585 transitions. [2025-03-03 20:06:16,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-03-03 20:06:16,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:16,389 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:16,403 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-03 20:06:16,590 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-03 20:06:16,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:16,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:16,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2143652005, now seen corresponding path program 1 times [2025-03-03 20:06:16,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:16,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915625511] [2025-03-03 20:06:16,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:16,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:16,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-03-03 20:06:16,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-03-03 20:06:16,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:16,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:17,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915625511] [2025-03-03 20:06:17,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915625511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:17,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:17,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263170903] [2025-03-03 20:06:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:17,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:17,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:17,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:17,726 INFO L87 Difference]: Start difference. First operand 343 states and 585 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:18,048 INFO L93 Difference]: Finished difference Result 1022 states and 1747 transitions. [2025-03-03 20:06:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:18,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-03-03 20:06:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:18,054 INFO L225 Difference]: With dead ends: 1022 [2025-03-03 20:06:18,054 INFO L226 Difference]: Without dead ends: 682 [2025-03-03 20:06:18,055 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-03 20:06:18,055 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 772 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:18,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1329 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-03 20:06:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2025-03-03 20:06:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 469 states have (on average 1.5906183368869935) internal successors, (746), 469 states have internal predecessors, (746), 208 states have call successors, (208), 2 states have call predecessors, (208), 2 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-03 20:06:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1162 transitions. [2025-03-03 20:06:18,133 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1162 transitions. Word has length 669 [2025-03-03 20:06:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:18,134 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1162 transitions. [2025-03-03 20:06:18,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1162 transitions. [2025-03-03 20:06:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:06:18,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:18,145 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:18,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:06:18,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:18,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1321022318, now seen corresponding path program 1 times [2025-03-03 20:06:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081726179] [2025-03-03 20:06:18,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:18,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:06:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:06:18,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:18,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:18,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081726179] [2025-03-03 20:06:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081726179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:18,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028239837] [2025-03-03 20:06:18,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:18,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:18,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:18,409 INFO L87 Difference]: Start difference. First operand 680 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:18,547 INFO L93 Difference]: Finished difference Result 2030 states and 3472 transitions. [2025-03-03 20:06:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:18,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-03-03 20:06:18,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:18,564 INFO L225 Difference]: With dead ends: 2030 [2025-03-03 20:06:18,564 INFO L226 Difference]: Without dead ends: 1353 [2025-03-03 20:06:18,567 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-03 20:06:18,567 INFO L435 NwaCegarLoop]: 1099 mSDtfsCounter, 571 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:18,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1653 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-03 20:06:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2025-03-03 20:06:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 930 states have (on average 1.5849462365591398) internal successors, (1474), 930 states have internal predecessors, (1474), 416 states have call successors, (416), 4 states have call predecessors, (416), 4 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-03-03 20:06:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2306 transitions. [2025-03-03 20:06:18,741 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2306 transitions. Word has length 670 [2025-03-03 20:06:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:18,742 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2306 transitions. [2025-03-03 20:06:18,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2306 transitions. [2025-03-03 20:06:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:06:18,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:18,751 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:18,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:06:18,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -212207119, now seen corresponding path program 1 times [2025-03-03 20:06:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369706747] [2025-03-03 20:06:18,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:18,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:06:18,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:06:18,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:18,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369706747] [2025-03-03 20:06:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369706747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:18,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:18,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412491380] [2025-03-03 20:06:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:18,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:18,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:18,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:18,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:18,986 INFO L87 Difference]: Start difference. First operand 1351 states and 2306 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:19,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:19,126 INFO L93 Difference]: Finished difference Result 3395 states and 5819 transitions. [2025-03-03 20:06:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-03-03 20:06:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:19,139 INFO L225 Difference]: With dead ends: 3395 [2025-03-03 20:06:19,139 INFO L226 Difference]: Without dead ends: 2047 [2025-03-03 20:06:19,144 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-03 20:06:19,145 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 337 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:19,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1379 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-03-03 20:06:19,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2016. [2025-03-03 20:06:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1503 states have (on average 1.6307385229540918) internal successors, (2451), 1507 states have internal predecessors, (2451), 504 states have call successors, (504), 8 states have call predecessors, (504), 8 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-03-03 20:06:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3459 transitions. [2025-03-03 20:06:19,307 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3459 transitions. Word has length 670 [2025-03-03 20:06:19,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:19,308 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3459 transitions. [2025-03-03 20:06:19,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3459 transitions. [2025-03-03 20:06:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:06:19,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:19,315 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:19,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:06:19,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:19,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:19,316 INFO L85 PathProgramCache]: Analyzing trace with hash -41073601, now seen corresponding path program 1 times [2025-03-03 20:06:19,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:19,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53451729] [2025-03-03 20:06:19,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:19,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:19,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:06:19,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:06:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:19,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:19,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:19,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53451729] [2025-03-03 20:06:19,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53451729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:19,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:19,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381918257] [2025-03-03 20:06:19,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:19,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:19,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:19,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:19,692 INFO L87 Difference]: Start difference. First operand 2016 states and 3459 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:20,048 INFO L93 Difference]: Finished difference Result 4732 states and 8125 transitions. [2025-03-03 20:06:20,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-03-03 20:06:20,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:20,067 INFO L225 Difference]: With dead ends: 4732 [2025-03-03 20:06:20,068 INFO L226 Difference]: Without dead ends: 2719 [2025-03-03 20:06:20,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:20,074 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 965 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:20,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2045 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:06:20,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-03-03 20:06:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2712. [2025-03-03 20:06:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2079 states have (on average 1.6459836459836459) internal successors, (3422), 2087 states have internal predecessors, (3422), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-03 20:06:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 4662 transitions. [2025-03-03 20:06:20,302 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 4662 transitions. Word has length 670 [2025-03-03 20:06:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:20,303 INFO L471 AbstractCegarLoop]: Abstraction has 2712 states and 4662 transitions. [2025-03-03 20:06:20,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:20,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 4662 transitions. [2025-03-03 20:06:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:06:20,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:20,313 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:20,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:06:20,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:20,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:20,314 INFO L85 PathProgramCache]: Analyzing trace with hash 79046272, now seen corresponding path program 1 times [2025-03-03 20:06:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:20,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948490500] [2025-03-03 20:06:20,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:20,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:06:20,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:06:20,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:20,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:20,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:20,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948490500] [2025-03-03 20:06:20,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948490500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:20,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:20,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096188596] [2025-03-03 20:06:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:20,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:20,510 INFO L87 Difference]: Start difference. First operand 2712 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:20,751 INFO L93 Difference]: Finished difference Result 8130 states and 13980 transitions. [2025-03-03 20:06:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-03-03 20:06:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:20,785 INFO L225 Difference]: With dead ends: 8130 [2025-03-03 20:06:20,785 INFO L226 Difference]: Without dead ends: 5421 [2025-03-03 20:06:20,793 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-03 20:06:20,794 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 564 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:20,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1164 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2025-03-03 20:06:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5419. [2025-03-03 20:06:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 4154 states have (on average 1.6417910447761195) internal successors, (6820), 4170 states have internal predecessors, (6820), 1240 states have call successors, (1240), 24 states have call predecessors, (1240), 24 states have return successors, (1240), 1224 states have call predecessors, (1240), 1240 states have call successors, (1240) [2025-03-03 20:06:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 9300 transitions. [2025-03-03 20:06:21,242 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 9300 transitions. Word has length 670 [2025-03-03 20:06:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:21,243 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 9300 transitions. [2025-03-03 20:06:21,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 9300 transitions. [2025-03-03 20:06:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-03-03 20:06:21,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:21,251 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:06:21,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:21,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -945647649, now seen corresponding path program 1 times [2025-03-03 20:06:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139009506] [2025-03-03 20:06:21,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:21,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-03-03 20:06:21,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-03-03 20:06:21,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139009506] [2025-03-03 20:06:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139009506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:21,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44830828] [2025-03-03 20:06:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:21,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:21,613 INFO L87 Difference]: Start difference. First operand 5419 states and 9300 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:21,987 INFO L93 Difference]: Finished difference Result 14131 states and 24248 transitions. [2025-03-03 20:06:21,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-03-03 20:06:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:22,033 INFO L225 Difference]: With dead ends: 14131 [2025-03-03 20:06:22,033 INFO L226 Difference]: Without dead ends: 8715 [2025-03-03 20:06:22,048 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-03 20:06:22,048 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 359 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:22,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1243 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2025-03-03 20:06:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 8711. [2025-03-03 20:06:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 6694 states have (on average 1.6402748730206156) internal successors, (10980), 6722 states have internal predecessors, (10980), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-03-03 20:06:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 14932 transitions. [2025-03-03 20:06:22,584 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 14932 transitions. Word has length 670 [2025-03-03 20:06:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:22,588 INFO L471 AbstractCegarLoop]: Abstraction has 8711 states and 14932 transitions. [2025-03-03 20:06:22,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 14932 transitions. [2025-03-03 20:06:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 20:06:22,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:22,601 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:22,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:06:22,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:22,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash 799063646, now seen corresponding path program 1 times [2025-03-03 20:06:22,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:22,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17464651] [2025-03-03 20:06:22,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:22,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 20:06:22,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 20:06:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:22,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:22,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17464651] [2025-03-03 20:06:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17464651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055559118] [2025-03-03 20:06:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:22,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:22,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:22,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:22,856 INFO L87 Difference]: Start difference. First operand 8711 states and 14932 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:23,117 INFO L93 Difference]: Finished difference Result 13079 states and 22435 transitions. [2025-03-03 20:06:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:23,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-03-03 20:06:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:23,149 INFO L225 Difference]: With dead ends: 13079 [2025-03-03 20:06:23,149 INFO L226 Difference]: Without dead ends: 4371 [2025-03-03 20:06:23,176 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-03 20:06:23,176 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 555 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:23,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 555 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2025-03-03 20:06:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2025-03-03 20:06:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 3362 states have (on average 1.6347412254610352) internal successors, (5496), 3376 states have internal predecessors, (5496), 988 states have call successors, (988), 20 states have call predecessors, (988), 20 states have return successors, (988), 974 states have call predecessors, (988), 988 states have call successors, (988) [2025-03-03 20:06:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 7472 transitions. [2025-03-03 20:06:23,474 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 7472 transitions. Word has length 671 [2025-03-03 20:06:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:23,475 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 7472 transitions. [2025-03-03 20:06:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 7472 transitions. [2025-03-03 20:06:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 20:06:23,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:23,481 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:23,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:06:23,481 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1429522271, now seen corresponding path program 1 times [2025-03-03 20:06:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533867414] [2025-03-03 20:06:23,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 20:06:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 20:06:23,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:23,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533867414] [2025-03-03 20:06:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533867414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:23,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797115823] [2025-03-03 20:06:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:23,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:23,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:23,670 INFO L87 Difference]: Start difference. First operand 4371 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:23,983 INFO L93 Difference]: Finished difference Result 13007 states and 22230 transitions. [2025-03-03 20:06:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-03-03 20:06:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:24,022 INFO L225 Difference]: With dead ends: 13007 [2025-03-03 20:06:24,022 INFO L226 Difference]: Without dead ends: 8639 [2025-03-03 20:06:24,035 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-03 20:06:24,035 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 540 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:24,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1163 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:24,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8639 states. [2025-03-03 20:06:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8639 to 8637. [2025-03-03 20:06:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8637 states, 6620 states have (on average 1.6235649546827795) internal successors, (10748), 6648 states have internal predecessors, (10748), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-03-03 20:06:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 14700 transitions. [2025-03-03 20:06:24,520 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 14700 transitions. Word has length 671 [2025-03-03 20:06:24,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:24,521 INFO L471 AbstractCegarLoop]: Abstraction has 8637 states and 14700 transitions. [2025-03-03 20:06:24,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 14700 transitions. [2025-03-03 20:06:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-03-03 20:06:24,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:24,529 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:06:24,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:24,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 765961501, now seen corresponding path program 1 times [2025-03-03 20:06:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:24,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727376400] [2025-03-03 20:06:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:24,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-03-03 20:06:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-03-03 20:06:24,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727376400] [2025-03-03 20:06:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727376400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895107941] [2025-03-03 20:06:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:24,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:24,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:24,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:24,813 INFO L87 Difference]: Start difference. First operand 8637 states and 14700 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:25,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:25,235 INFO L93 Difference]: Finished difference Result 17271 states and 29397 transitions. [2025-03-03 20:06:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-03-03 20:06:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:25,278 INFO L225 Difference]: With dead ends: 17271 [2025-03-03 20:06:25,278 INFO L226 Difference]: Without dead ends: 8637 [2025-03-03 20:06:25,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:25,307 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 567 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:25,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8637 states. [2025-03-03 20:06:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8637 to 8637. [2025-03-03 20:06:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8637 states, 6620 states have (on average 1.6199395770392748) internal successors, (10724), 6648 states have internal predecessors, (10724), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-03-03 20:06:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8637 states to 8637 states and 14676 transitions. [2025-03-03 20:06:26,039 INFO L78 Accepts]: Start accepts. Automaton has 8637 states and 14676 transitions. Word has length 671 [2025-03-03 20:06:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:26,040 INFO L471 AbstractCegarLoop]: Abstraction has 8637 states and 14676 transitions. [2025-03-03 20:06:26,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8637 states and 14676 transitions. [2025-03-03 20:06:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:26,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:26,048 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:26,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:06:26,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1401623555, now seen corresponding path program 1 times [2025-03-03 20:06:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603784630] [2025-03-03 20:06:26,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:26,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:26,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:26,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:26,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:26,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:26,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603784630] [2025-03-03 20:06:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603784630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810639678] [2025-03-03 20:06:26,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:26,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:26,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:26,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:26,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:26,395 INFO L87 Difference]: Start difference. First operand 8637 states and 14676 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:26,850 INFO L93 Difference]: Finished difference Result 22457 states and 37678 transitions. [2025-03-03 20:06:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:26,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:26,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:26,913 INFO L225 Difference]: With dead ends: 22457 [2025-03-03 20:06:26,914 INFO L226 Difference]: Without dead ends: 13823 [2025-03-03 20:06:26,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:26,940 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 392 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:26,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1141 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2025-03-03 20:06:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 8677. [2025-03-03 20:06:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8677 states, 6660 states have (on average 1.6162162162162161) internal successors, (10764), 6688 states have internal predecessors, (10764), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-03-03 20:06:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8677 states to 8677 states and 14716 transitions. [2025-03-03 20:06:27,850 INFO L78 Accepts]: Start accepts. Automaton has 8677 states and 14716 transitions. Word has length 673 [2025-03-03 20:06:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:27,851 INFO L471 AbstractCegarLoop]: Abstraction has 8677 states and 14716 transitions. [2025-03-03 20:06:27,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 8677 states and 14716 transitions. [2025-03-03 20:06:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:27,862 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:27,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:06:27,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:27,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2048871870, now seen corresponding path program 1 times [2025-03-03 20:06:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997910383] [2025-03-03 20:06:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:27,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:27,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:27,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997910383] [2025-03-03 20:06:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997910383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:28,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:28,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:28,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502353989] [2025-03-03 20:06:28,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:28,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:28,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:28,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:28,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:28,235 INFO L87 Difference]: Start difference. First operand 8677 states and 14716 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:29,042 INFO L93 Difference]: Finished difference Result 13995 states and 23747 transitions. [2025-03-03 20:06:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:29,091 INFO L225 Difference]: With dead ends: 13995 [2025-03-03 20:06:29,091 INFO L226 Difference]: Without dead ends: 11841 [2025-03-03 20:06:29,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:29,103 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 819 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1695 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:06:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11841 states. [2025-03-03 20:06:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11841 to 11821. [2025-03-03 20:06:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11821 states, 9304 states have (on average 1.6276870163370594) internal successors, (15144), 9348 states have internal predecessors, (15144), 2456 states have call successors, (2456), 60 states have call predecessors, (2456), 60 states have return successors, (2456), 2412 states have call predecessors, (2456), 2456 states have call successors, (2456) [2025-03-03 20:06:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 20056 transitions. [2025-03-03 20:06:29,987 INFO L78 Accepts]: Start accepts. Automaton has 11821 states and 20056 transitions. Word has length 673 [2025-03-03 20:06:29,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:29,988 INFO L471 AbstractCegarLoop]: Abstraction has 11821 states and 20056 transitions. [2025-03-03 20:06:29,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11821 states and 20056 transitions. [2025-03-03 20:06:30,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:30,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:30,001 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:30,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:06:30,001 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1775521475, now seen corresponding path program 1 times [2025-03-03 20:06:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480498676] [2025-03-03 20:06:30,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:30,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:30,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:30,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:30,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480498676] [2025-03-03 20:06:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480498676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:30,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:30,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:06:30,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731517702] [2025-03-03 20:06:30,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:30,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:06:30,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:30,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:06:30,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:06:30,576 INFO L87 Difference]: Start difference. First operand 11821 states and 20056 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:31,972 INFO L93 Difference]: Finished difference Result 25451 states and 43130 transitions. [2025-03-03 20:06:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:06:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:32,030 INFO L225 Difference]: With dead ends: 25451 [2025-03-03 20:06:32,030 INFO L226 Difference]: Without dead ends: 13633 [2025-03-03 20:06:32,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:32,054 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 1868 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:32,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1859 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:06:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13633 states. [2025-03-03 20:06:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13633 to 13615. [2025-03-03 20:06:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13615 states, 10762 states have (on average 1.6244192529269652) internal successors, (17482), 10818 states have internal predecessors, (17482), 2768 states have call successors, (2768), 84 states have call predecessors, (2768), 84 states have return successors, (2768), 2712 states have call predecessors, (2768), 2768 states have call successors, (2768) [2025-03-03 20:06:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13615 states to 13615 states and 23018 transitions. [2025-03-03 20:06:32,734 INFO L78 Accepts]: Start accepts. Automaton has 13615 states and 23018 transitions. Word has length 673 [2025-03-03 20:06:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:32,735 INFO L471 AbstractCegarLoop]: Abstraction has 13615 states and 23018 transitions. [2025-03-03 20:06:32,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 13615 states and 23018 transitions. [2025-03-03 20:06:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:32,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:32,745 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:06:32,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1462716451, now seen corresponding path program 1 times [2025-03-03 20:06:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829231031] [2025-03-03 20:06:32,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:32,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:32,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:32,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:32,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:33,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829231031] [2025-03-03 20:06:33,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829231031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:33,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:33,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 20:06:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048567931] [2025-03-03 20:06:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:33,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:06:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:33,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:06:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:06:33,631 INFO L87 Difference]: Start difference. First operand 13615 states and 23018 transitions. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:38,162 INFO L93 Difference]: Finished difference Result 43309 states and 72755 transitions. [2025-03-03 20:06:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:06:38,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 673 [2025-03-03 20:06:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:38,275 INFO L225 Difference]: With dead ends: 43309 [2025-03-03 20:06:38,275 INFO L226 Difference]: Without dead ends: 29697 [2025-03-03 20:06:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=725, Unknown=0, NotChecked=0, Total=992 [2025-03-03 20:06:38,312 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4036 mSDsluCounter, 5313 mSDsCounter, 0 mSdLazyCounter, 4617 mSolverCounterSat, 866 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4036 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 5483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 866 IncrementalHoareTripleChecker+Valid, 4617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:38,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4036 Valid, 5966 Invalid, 5483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [866 Valid, 4617 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 20:06:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29697 states. [2025-03-03 20:06:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29697 to 22087. [2025-03-03 20:06:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22087 states, 17576 states have (on average 1.6207897132453346) internal successors, (28487), 17674 states have internal predecessors, (28487), 4368 states have call successors, (4368), 142 states have call predecessors, (4368), 142 states have return successors, (4368), 4270 states have call predecessors, (4368), 4368 states have call successors, (4368) [2025-03-03 20:06:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22087 states to 22087 states and 37223 transitions. [2025-03-03 20:06:39,548 INFO L78 Accepts]: Start accepts. Automaton has 22087 states and 37223 transitions. Word has length 673 [2025-03-03 20:06:39,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:39,549 INFO L471 AbstractCegarLoop]: Abstraction has 22087 states and 37223 transitions. [2025-03-03 20:06:39,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-03-03 20:06:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 22087 states and 37223 transitions. [2025-03-03 20:06:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:39,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:39,558 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:39,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:06:39,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 287020093, now seen corresponding path program 1 times [2025-03-03 20:06:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810991993] [2025-03-03 20:06:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:39,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:39,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:39,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:39,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:39,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810991993] [2025-03-03 20:06:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810991993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:06:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274556553] [2025-03-03 20:06:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:06:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:40,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:06:40,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:06:40,289 INFO L87 Difference]: Start difference. First operand 22087 states and 37223 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:42,993 INFO L93 Difference]: Finished difference Result 42621 states and 71564 transitions. [2025-03-03 20:06:42,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:06:42,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:43,100 INFO L225 Difference]: With dead ends: 42621 [2025-03-03 20:06:43,101 INFO L226 Difference]: Without dead ends: 29747 [2025-03-03 20:06:43,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:06:43,124 INFO L435 NwaCegarLoop]: 1108 mSDtfsCounter, 1413 mSDsluCounter, 2519 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1413 SdHoareTripleChecker+Valid, 3627 SdHoareTripleChecker+Invalid, 2086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:43,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1413 Valid, 3627 Invalid, 2086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 20:06:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2025-03-03 20:06:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 22301. [2025-03-03 20:06:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22301 states, 17790 states have (on average 1.6163575042158516) internal successors, (28755), 17888 states have internal predecessors, (28755), 4368 states have call successors, (4368), 142 states have call predecessors, (4368), 142 states have return successors, (4368), 4270 states have call predecessors, (4368), 4368 states have call successors, (4368) [2025-03-03 20:06:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22301 states to 22301 states and 37491 transitions. [2025-03-03 20:06:44,302 INFO L78 Accepts]: Start accepts. Automaton has 22301 states and 37491 transitions. Word has length 673 [2025-03-03 20:06:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:44,303 INFO L471 AbstractCegarLoop]: Abstraction has 22301 states and 37491 transitions. [2025-03-03 20:06:44,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 22301 states and 37491 transitions. [2025-03-03 20:06:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:44,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:44,312 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:06:44,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1623008606, now seen corresponding path program 1 times [2025-03-03 20:06:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:44,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125362801] [2025-03-03 20:06:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:44,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:44,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:44,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:44,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:44,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125362801] [2025-03-03 20:06:44,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125362801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:44,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:44,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:06:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76380037] [2025-03-03 20:06:44,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:44,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:44,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:44,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:44,841 INFO L87 Difference]: Start difference. First operand 22301 states and 37491 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:46,862 INFO L93 Difference]: Finished difference Result 38141 states and 63927 transitions. [2025-03-03 20:06:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:06:46,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:47,049 INFO L225 Difference]: With dead ends: 38141 [2025-03-03 20:06:47,050 INFO L226 Difference]: Without dead ends: 25053 [2025-03-03 20:06:47,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:06:47,069 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1948 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:47,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1948 Valid, 3053 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 20:06:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25053 states. [2025-03-03 20:06:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25053 to 23073. [2025-03-03 20:06:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23073 states, 18398 states have (on average 1.6152299162952495) internal successors, (29717), 18500 states have internal predecessors, (29717), 4520 states have call successors, (4520), 154 states have call predecessors, (4520), 154 states have return successors, (4520), 4418 states have call predecessors, (4520), 4520 states have call successors, (4520) [2025-03-03 20:06:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23073 states to 23073 states and 38757 transitions. [2025-03-03 20:06:48,220 INFO L78 Accepts]: Start accepts. Automaton has 23073 states and 38757 transitions. Word has length 673 [2025-03-03 20:06:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:48,221 INFO L471 AbstractCegarLoop]: Abstraction has 23073 states and 38757 transitions. [2025-03-03 20:06:48,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23073 states and 38757 transitions. [2025-03-03 20:06:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:48,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:48,231 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:06:48,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:48,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash -922222146, now seen corresponding path program 1 times [2025-03-03 20:06:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170238085] [2025-03-03 20:06:48,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:48,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:48,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:48,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:48,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170238085] [2025-03-03 20:06:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170238085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:06:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933305406] [2025-03-03 20:06:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:06:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:48,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:06:48,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:06:48,940 INFO L87 Difference]: Start difference. First operand 23073 states and 38757 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:51,907 INFO L93 Difference]: Finished difference Result 72487 states and 120896 transitions. [2025-03-03 20:06:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:06:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:52,046 INFO L225 Difference]: With dead ends: 72487 [2025-03-03 20:06:52,046 INFO L226 Difference]: Without dead ends: 49081 [2025-03-03 20:06:52,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03 20:06:52,095 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 690 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:52,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1768 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:06:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49081 states. [2025-03-03 20:06:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49081 to 41603. [2025-03-03 20:06:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41603 states, 33006 states have (on average 1.6107374416772708) internal successors, (53164), 33226 states have internal predecessors, (53164), 8288 states have call successors, (8288), 308 states have call predecessors, (8288), 308 states have return successors, (8288), 8068 states have call predecessors, (8288), 8288 states have call successors, (8288) [2025-03-03 20:06:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 69740 transitions. [2025-03-03 20:06:54,962 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 69740 transitions. Word has length 673 [2025-03-03 20:06:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:54,963 INFO L471 AbstractCegarLoop]: Abstraction has 41603 states and 69740 transitions. [2025-03-03 20:06:54,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 69740 transitions. [2025-03-03 20:06:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:06:54,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:54,999 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:06:54,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:06:54,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1597305762, now seen corresponding path program 1 times [2025-03-03 20:06:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:55,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546232307] [2025-03-03 20:06:55,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:06:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:06:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:06:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:56,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546232307] [2025-03-03 20:06:56,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546232307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:56,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:56,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116287681] [2025-03-03 20:06:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:56,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:56,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:56,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:56,280 INFO L87 Difference]: Start difference. First operand 41603 states and 69740 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:06:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:58,815 INFO L93 Difference]: Finished difference Result 83203 states and 139477 transitions. [2025-03-03 20:06:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:58,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:06:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:58,959 INFO L225 Difference]: With dead ends: 83203 [2025-03-03 20:06:58,960 INFO L226 Difference]: Without dead ends: 41603 [2025-03-03 20:06:59,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:59,043 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:59,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 553 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41603 states. [2025-03-03 20:07:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41603 to 41603. [2025-03-03 20:07:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41603 states, 33006 states have (on average 1.5960734411925104) internal successors, (52680), 33226 states have internal predecessors, (52680), 8288 states have call successors, (8288), 308 states have call predecessors, (8288), 308 states have return successors, (8288), 8068 states have call predecessors, (8288), 8288 states have call successors, (8288) [2025-03-03 20:07:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 69256 transitions. [2025-03-03 20:07:02,523 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 69256 transitions. Word has length 673 [2025-03-03 20:07:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:02,524 INFO L471 AbstractCegarLoop]: Abstraction has 41603 states and 69256 transitions. [2025-03-03 20:07:02,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:07:02,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 69256 transitions. [2025-03-03 20:07:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-03-03 20:07:02,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:02,541 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:07:02,542 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -228468034, now seen corresponding path program 1 times [2025-03-03 20:07:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:02,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223639998] [2025-03-03 20:07:02,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:02,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-03-03 20:07:02,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-03-03 20:07:02,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:07:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223639998] [2025-03-03 20:07:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223639998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483634312] [2025-03-03 20:07:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:02,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:02,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:02,919 INFO L87 Difference]: Start difference. First operand 41603 states and 69256 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:07:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:11,816 INFO L93 Difference]: Finished difference Result 206121 states and 341907 transitions. [2025-03-03 20:07:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:07:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-03-03 20:07:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:12,258 INFO L225 Difference]: With dead ends: 206121 [2025-03-03 20:07:12,258 INFO L226 Difference]: Without dead ends: 164521 [2025-03-03 20:07:12,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:12,362 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 1299 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:12,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 2665 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:07:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164521 states. [2025-03-03 20:07:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164521 to 95649. [2025-03-03 20:07:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95649 states, 81828 states have (on average 1.6634403871535415) internal successors, (136116), 82244 states have internal predecessors, (136116), 13248 states have call successors, (13248), 572 states have call predecessors, (13248), 572 states have return successors, (13248), 12832 states have call predecessors, (13248), 13248 states have call successors, (13248) [2025-03-03 20:07:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95649 states to 95649 states and 162612 transitions. [2025-03-03 20:07:17,273 INFO L78 Accepts]: Start accepts. Automaton has 95649 states and 162612 transitions. Word has length 673 [2025-03-03 20:07:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:17,273 INFO L471 AbstractCegarLoop]: Abstraction has 95649 states and 162612 transitions. [2025-03-03 20:07:17,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:07:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 95649 states and 162612 transitions. [2025-03-03 20:07:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2025-03-03 20:07:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:17,307 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:07:17,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 20:07:17,307 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:17,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2075952010, now seen corresponding path program 1 times [2025-03-03 20:07:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:17,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799628609] [2025-03-03 20:07:17,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:17,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:17,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 674 statements into 1 equivalence classes. [2025-03-03 20:07:17,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 674 of 674 statements. [2025-03-03 20:07:17,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:17,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-03-03 20:07:17,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:17,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799628609] [2025-03-03 20:07:17,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799628609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:17,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:17,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677357532] [2025-03-03 20:07:17,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:17,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:17,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:17,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:17,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:17,862 INFO L87 Difference]: Start difference. First operand 95649 states and 162612 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-03-03 20:07:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:21,426 INFO L93 Difference]: Finished difference Result 191727 states and 326085 transitions. [2025-03-03 20:07:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 674 [2025-03-03 20:07:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:21,706 INFO L225 Difference]: With dead ends: 191727 [2025-03-03 20:07:21,706 INFO L226 Difference]: Without dead ends: 96081 [2025-03-03 20:07:21,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:21,859 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:21,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1093 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96081 states.