./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-35.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-35.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 3158fa3d023f69512eee9279d2328b5cbe07498d18204302959fda73512afb8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:07:20,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:07:20,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:07:20,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:07:20,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:07:20,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:07:20,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:07:20,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:07:20,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:07:20,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:07:20,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:07:20,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:07:20,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:07:20,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:07:20,817 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:07:20,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:07:20,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:07:20,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:07:20,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:20,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:07:20,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:07:20,820 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 -> 3158fa3d023f69512eee9279d2328b5cbe07498d18204302959fda73512afb8f [2025-03-03 20:07:21,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:07:21,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:07:21,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:07:21,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:07:21,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:07:21,064 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-35.i [2025-03-03 20:07:22,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ebd788b/621585eeb6364f21857c7cd42023f051/FLAG31432b1d7 [2025-03-03 20:07:22,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:07:22,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-35.i [2025-03-03 20:07:22,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ebd788b/621585eeb6364f21857c7cd42023f051/FLAG31432b1d7 [2025-03-03 20:07:22,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ebd788b/621585eeb6364f21857c7cd42023f051 [2025-03-03 20:07:22,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:07:22,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:07:22,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:22,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:07:22,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:07:22,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:22" (1/1) ... [2025-03-03 20:07:22,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f608f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:22, skipping insertion in model container [2025-03-03 20:07:22,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:07:22" (1/1) ... [2025-03-03 20:07:22,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:07:22,947 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-35.i[916,929] [2025-03-03 20:07:23,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:23,079 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:07:23,086 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-35.i[916,929] [2025-03-03 20:07:23,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:07:23,168 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:07:23,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23 WrapperNode [2025-03-03 20:07:23,169 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:07:23,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:23,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:07:23,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:07:23,174 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:07:23" (1/1) ... [2025-03-03 20:07:23,197 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:07:23" (1/1) ... [2025-03-03 20:07:23,250 INFO L138 Inliner]: procedures = 26, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 821 [2025-03-03 20:07:23,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:07:23,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:07:23,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:07:23,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:07:23,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,301 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:07:23,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:07:23,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:07:23,366 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:07:23,366 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:07:23,367 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (1/1) ... [2025-03-03 20:07:23,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:07:23,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:23,394 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:07:23,396 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:07:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:07:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:07:23,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:07:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:07:23,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:07:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:07:23,540 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:07:23,541 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:07:24,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc property_#t~bitwise82#1;havoc property_#t~short83#1; [2025-03-03 20:07:24,606 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:07:24,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:07:24,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:07:24,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:07:24,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:24 BoogieIcfgContainer [2025-03-03 20:07:24,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:07:24,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:07:24,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:07:24,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:07:24,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:07:22" (1/3) ... [2025-03-03 20:07:24,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675c3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:24, skipping insertion in model container [2025-03-03 20:07:24,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:07:23" (2/3) ... [2025-03-03 20:07:24,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675c3d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:07:24, skipping insertion in model container [2025-03-03 20:07:24,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:07:24" (3/3) ... [2025-03-03 20:07:24,651 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-35.i [2025-03-03 20:07:24,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:07:24,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-35.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:07:24,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:07:24,730 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;@2f5a51d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:07:24,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:07:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 224 states have internal predecessors, (346), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 20:07:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:24,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:24,763 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1680807291, now seen corresponding path program 1 times [2025-03-03 20:07:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827403174] [2025-03-03 20:07:24,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:24,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:24,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:24,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 28322 trivial. 0 not checked. [2025-03-03 20:07:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:25,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827403174] [2025-03-03 20:07:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827403174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:07:25,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211601748] [2025-03-03 20:07:25,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:07:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:07:25,409 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:07:25,411 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:07:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:25,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:25,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:25,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:25,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:07:25,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:07:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 28322 trivial. 0 not checked. [2025-03-03 20:07:25,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:07:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211601748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:07:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:07:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314407672] [2025-03-03 20:07:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:25,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:07:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:07:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:07:25,908 INFO L87 Difference]: Start difference. First operand has 346 states, 223 states have (on average 1.5515695067264574) internal successors, (346), 224 states have internal predecessors, (346), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2025-03-03 20:07:25,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:25,994 INFO L93 Difference]: Finished difference Result 686 states and 1287 transitions. [2025-03-03 20:07:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:07:25,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) Word has length 752 [2025-03-03 20:07:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:26,006 INFO L225 Difference]: With dead ends: 686 [2025-03-03 20:07:26,007 INFO L226 Difference]: Without dead ends: 343 [2025-03-03 20:07:26,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 753 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:07:26,017 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:26,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-03 20:07:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-03 20:07:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 221 states have (on average 1.5429864253393666) internal successors, (341), 221 states have internal predecessors, (341), 120 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-03 20:07:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 581 transitions. [2025-03-03 20:07:26,112 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 581 transitions. Word has length 752 [2025-03-03 20:07:26,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:26,114 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 581 transitions. [2025-03-03 20:07:26,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (120), 2 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 2 states have call successors, (120) [2025-03-03 20:07:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 581 transitions. [2025-03-03 20:07:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:26,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:26,134 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:07:26,339 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:07:26,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:26,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:26,340 INFO L85 PathProgramCache]: Analyzing trace with hash 361242623, now seen corresponding path program 1 times [2025-03-03 20:07:26,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:26,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956618365] [2025-03-03 20:07:26,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:26,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:26,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:26,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:26,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:26,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956618365] [2025-03-03 20:07:26,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956618365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:26,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:26,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:26,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439456305] [2025-03-03 20:07:26,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:26,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:26,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:26,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:26,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:26,963 INFO L87 Difference]: Start difference. First operand 343 states and 581 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:27,090 INFO L93 Difference]: Finished difference Result 861 states and 1469 transitions. [2025-03-03 20:07:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 752 [2025-03-03 20:07:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:27,097 INFO L225 Difference]: With dead ends: 861 [2025-03-03 20:07:27,097 INFO L226 Difference]: Without dead ends: 521 [2025-03-03 20:07:27,098 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:07:27,099 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 301 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:27,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-03 20:07:27,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 518. [2025-03-03 20:07:27,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 375 states have (on average 1.6106666666666667) internal successors, (604), 376 states have internal predecessors, (604), 140 states have call successors, (140), 2 states have call predecessors, (140), 2 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 20:07:27,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 884 transitions. [2025-03-03 20:07:27,175 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 884 transitions. Word has length 752 [2025-03-03 20:07:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:27,178 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 884 transitions. [2025-03-03 20:07:27,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 884 transitions. [2025-03-03 20:07:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:27,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:27,185 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:07:27,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:27,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1747790626, now seen corresponding path program 1 times [2025-03-03 20:07:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:27,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353046469] [2025-03-03 20:07:27,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:27,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:27,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:27,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353046469] [2025-03-03 20:07:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353046469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:27,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:27,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:27,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25073520] [2025-03-03 20:07:27,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:27,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:27,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:27,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:27,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:27,498 INFO L87 Difference]: Start difference. First operand 518 states and 884 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:27,593 INFO L93 Difference]: Finished difference Result 1386 states and 2372 transitions. [2025-03-03 20:07:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 752 [2025-03-03 20:07:27,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:27,601 INFO L225 Difference]: With dead ends: 1386 [2025-03-03 20:07:27,601 INFO L226 Difference]: Without dead ends: 871 [2025-03-03 20:07:27,603 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:07:27,603 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 339 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:27,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1392 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:07:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-03 20:07:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 868. [2025-03-03 20:07:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 655 states have (on average 1.630534351145038) internal successors, (1068), 658 states have internal predecessors, (1068), 208 states have call successors, (208), 4 states have call predecessors, (208), 4 states have return successors, (208), 205 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-03 20:07:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1484 transitions. [2025-03-03 20:07:27,690 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1484 transitions. Word has length 752 [2025-03-03 20:07:27,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:27,691 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1484 transitions. [2025-03-03 20:07:27,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1484 transitions. [2025-03-03 20:07:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:27,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:27,696 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:07:27,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:27,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -793561731, now seen corresponding path program 1 times [2025-03-03 20:07:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603116139] [2025-03-03 20:07:27,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:27,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:27,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:27,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:27,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603116139] [2025-03-03 20:07:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603116139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:27,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724746848] [2025-03-03 20:07:27,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:27,961 INFO L87 Difference]: Start difference. First operand 868 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:28,050 INFO L93 Difference]: Finished difference Result 2331 states and 3963 transitions. [2025-03-03 20:07:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 752 [2025-03-03 20:07:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:28,059 INFO L225 Difference]: With dead ends: 2331 [2025-03-03 20:07:28,059 INFO L226 Difference]: Without dead ends: 1466 [2025-03-03 20:07:28,061 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:07:28,062 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 367 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:28,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1480 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-03 20:07:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1463. [2025-03-03 20:07:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1063 states have (on average 1.5898400752587019) internal successors, (1690), 1070 states have internal predecessors, (1690), 391 states have call successors, (391), 8 states have call predecessors, (391), 8 states have return successors, (391), 384 states have call predecessors, (391), 391 states have call successors, (391) [2025-03-03 20:07:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2472 transitions. [2025-03-03 20:07:28,163 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2472 transitions. Word has length 752 [2025-03-03 20:07:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:28,164 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2472 transitions. [2025-03-03 20:07:28,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2472 transitions. [2025-03-03 20:07:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:28,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:28,172 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:07:28,172 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:28,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash -801321090, now seen corresponding path program 1 times [2025-03-03 20:07:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592572654] [2025-03-03 20:07:28,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:28,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:28,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:28,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:28,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:28,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592572654] [2025-03-03 20:07:28,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592572654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:28,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:28,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851883443] [2025-03-03 20:07:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:28,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:28,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:28,403 INFO L87 Difference]: Start difference. First operand 1463 states and 2472 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:28,519 INFO L93 Difference]: Finished difference Result 2935 states and 4950 transitions. [2025-03-03 20:07:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:28,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 752 [2025-03-03 20:07:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:28,530 INFO L225 Difference]: With dead ends: 2935 [2025-03-03 20:07:28,530 INFO L226 Difference]: Without dead ends: 1475 [2025-03-03 20:07:28,533 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:07:28,534 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 294 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:28,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1156 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2025-03-03 20:07:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1127. [2025-03-03 20:07:28,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 865 states have (on average 1.6485549132947976) internal successors, (1426), 868 states have internal predecessors, (1426), 255 states have call successors, (255), 6 states have call predecessors, (255), 6 states have return successors, (255), 252 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-03 20:07:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1936 transitions. [2025-03-03 20:07:28,602 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1936 transitions. Word has length 752 [2025-03-03 20:07:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:28,605 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1936 transitions. [2025-03-03 20:07:28,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1936 transitions. [2025-03-03 20:07:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-03 20:07:28,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:28,613 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:07:28,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:28,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1210145315, now seen corresponding path program 1 times [2025-03-03 20:07:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095362859] [2025-03-03 20:07:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:28,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:28,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes. [2025-03-03 20:07:28,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 752 of 752 statements. [2025-03-03 20:07:28,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:28,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:29,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:29,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095362859] [2025-03-03 20:07:29,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095362859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:29,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:29,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:29,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366146181] [2025-03-03 20:07:29,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:29,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:29,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:29,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:29,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:29,215 INFO L87 Difference]: Start difference. First operand 1127 states and 1936 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:29,788 INFO L93 Difference]: Finished difference Result 3449 states and 5907 transitions. [2025-03-03 20:07:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 752 [2025-03-03 20:07:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:29,800 INFO L225 Difference]: With dead ends: 3449 [2025-03-03 20:07:29,800 INFO L226 Difference]: Without dead ends: 2325 [2025-03-03 20:07:29,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:07:29,803 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 541 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:29,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 2052 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2025-03-03 20:07:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2249. [2025-03-03 20:07:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 1726 states have (on average 1.6477404403244496) internal successors, (2844), 1732 states have internal predecessors, (2844), 510 states have call successors, (510), 12 states have call predecessors, (510), 12 states have return successors, (510), 504 states have call predecessors, (510), 510 states have call successors, (510) [2025-03-03 20:07:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 3864 transitions. [2025-03-03 20:07:29,926 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 3864 transitions. Word has length 752 [2025-03-03 20:07:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:29,928 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 3864 transitions. [2025-03-03 20:07:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 3864 transitions. [2025-03-03 20:07:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-03 20:07:29,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:29,934 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:07:29,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1541232048, now seen corresponding path program 1 times [2025-03-03 20:07:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322389079] [2025-03-03 20:07:29,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:29,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes. [2025-03-03 20:07:30,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements. [2025-03-03 20:07:30,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:30,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322389079] [2025-03-03 20:07:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322389079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:07:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038807425] [2025-03-03 20:07:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:07:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:30,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:07:30,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:07:30,366 INFO L87 Difference]: Start difference. First operand 2249 states and 3864 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, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:30,535 INFO L93 Difference]: Finished difference Result 6741 states and 11586 transitions. [2025-03-03 20:07:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:07:30,536 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, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 753 [2025-03-03 20:07:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:30,583 INFO L225 Difference]: With dead ends: 6741 [2025-03-03 20:07:30,583 INFO L226 Difference]: Without dead ends: 4495 [2025-03-03 20:07:30,588 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:07:30,589 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 343 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:30,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1223 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:07:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2025-03-03 20:07:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 4493. [2025-03-03 20:07:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 3448 states have (on average 1.6392111368909512) internal successors, (5652), 3460 states have internal predecessors, (5652), 1020 states have call successors, (1020), 24 states have call predecessors, (1020), 24 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-03 20:07:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 7692 transitions. [2025-03-03 20:07:30,919 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 7692 transitions. Word has length 753 [2025-03-03 20:07:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 4493 states and 7692 transitions. [2025-03-03 20:07:30,920 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, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 7692 transitions. [2025-03-03 20:07:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-03-03 20:07:30,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:30,930 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:07:30,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1603162780, now seen corresponding path program 1 times [2025-03-03 20:07:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:30,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803067298] [2025-03-03 20:07:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-03-03 20:07:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-03-03 20:07:31,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803067298] [2025-03-03 20:07:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803067298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:07:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047773124] [2025-03-03 20:07:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:31,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:07:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:31,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:07:31,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:31,334 INFO L87 Difference]: Start difference. First operand 4493 states and 7692 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:32,251 INFO L93 Difference]: Finished difference Result 16835 states and 28895 transitions. [2025-03-03 20:07:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:07:32,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 754 [2025-03-03 20:07:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:32,321 INFO L225 Difference]: With dead ends: 16835 [2025-03-03 20:07:32,321 INFO L226 Difference]: Without dead ends: 12345 [2025-03-03 20:07:32,336 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:07:32,337 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 849 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:32,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1819 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2025-03-03 20:07:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 12333. [2025-03-03 20:07:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12333 states, 9828 states have (on average 1.6528286528286529) internal successors, (16244), 9868 states have internal predecessors, (16244), 2440 states have call successors, (2440), 64 states have call predecessors, (2440), 64 states have return successors, (2440), 2400 states have call predecessors, (2440), 2440 states have call successors, (2440) [2025-03-03 20:07:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12333 states to 12333 states and 21124 transitions. [2025-03-03 20:07:32,923 INFO L78 Accepts]: Start accepts. Automaton has 12333 states and 21124 transitions. Word has length 754 [2025-03-03 20:07:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:32,924 INFO L471 AbstractCegarLoop]: Abstraction has 12333 states and 21124 transitions. [2025-03-03 20:07:32,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12333 states and 21124 transitions. [2025-03-03 20:07:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-03-03 20:07:32,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:32,936 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:07:32,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:32,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 348880101, now seen corresponding path program 1 times [2025-03-03 20:07:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501275664] [2025-03-03 20:07:32,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:32,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-03-03 20:07:33,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-03-03 20:07:33,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:33,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501275664] [2025-03-03 20:07:33,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501275664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:33,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933590505] [2025-03-03 20:07:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:33,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:33,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:33,573 INFO L87 Difference]: Start difference. First operand 12333 states and 21124 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:34,576 INFO L93 Difference]: Finished difference Result 37619 states and 64231 transitions. [2025-03-03 20:07:34,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:34,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 754 [2025-03-03 20:07:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:34,665 INFO L225 Difference]: With dead ends: 37619 [2025-03-03 20:07:34,665 INFO L226 Difference]: Without dead ends: 25289 [2025-03-03 20:07:34,706 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:07:34,709 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 543 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:34,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1712 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:07:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25289 states. [2025-03-03 20:07:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25289 to 24661. [2025-03-03 20:07:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24661 states, 19652 states have (on average 1.6505190311418685) internal successors, (32436), 19732 states have internal predecessors, (32436), 4880 states have call successors, (4880), 128 states have call predecessors, (4880), 128 states have return successors, (4880), 4800 states have call predecessors, (4880), 4880 states have call successors, (4880) [2025-03-03 20:07:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24661 states to 24661 states and 42196 transitions. [2025-03-03 20:07:35,893 INFO L78 Accepts]: Start accepts. Automaton has 24661 states and 42196 transitions. Word has length 754 [2025-03-03 20:07:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 24661 states and 42196 transitions. [2025-03-03 20:07:35,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24661 states and 42196 transitions. [2025-03-03 20:07:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-03-03 20:07:35,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:35,904 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:07:35,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -495591770, now seen corresponding path program 1 times [2025-03-03 20:07:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005583530] [2025-03-03 20:07:35,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:35,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:35,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-03-03 20:07:35,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-03-03 20:07:35,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:35,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005583530] [2025-03-03 20:07:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005583530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:36,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:36,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950224978] [2025-03-03 20:07:36,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:36,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:36,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:36,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:36,409 INFO L87 Difference]: Start difference. First operand 24661 states and 42196 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:38,650 INFO L93 Difference]: Finished difference Result 77003 states and 130903 transitions. [2025-03-03 20:07:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:38,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 754 [2025-03-03 20:07:38,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:38,840 INFO L225 Difference]: With dead ends: 77003 [2025-03-03 20:07:38,840 INFO L226 Difference]: Without dead ends: 52345 [2025-03-03 20:07:38,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:07:38,924 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 619 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:38,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 2001 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:07:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52345 states. [2025-03-03 20:07:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52345 to 28933. [2025-03-03 20:07:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28933 states, 23156 states have (on average 1.6101226463983416) internal successors, (37284), 23332 states have internal predecessors, (37284), 5552 states have call successors, (5552), 224 states have call predecessors, (5552), 224 states have return successors, (5552), 5376 states have call predecessors, (5552), 5552 states have call successors, (5552) [2025-03-03 20:07:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28933 states to 28933 states and 48388 transitions. [2025-03-03 20:07:40,711 INFO L78 Accepts]: Start accepts. Automaton has 28933 states and 48388 transitions. Word has length 754 [2025-03-03 20:07:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:40,712 INFO L471 AbstractCegarLoop]: Abstraction has 28933 states and 48388 transitions. [2025-03-03 20:07:40,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28933 states and 48388 transitions. [2025-03-03 20:07:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 755 [2025-03-03 20:07:40,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:40,725 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:40,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:40,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:40,727 INFO L85 PathProgramCache]: Analyzing trace with hash -788994777, now seen corresponding path program 1 times [2025-03-03 20:07:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772758606] [2025-03-03 20:07:40,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:40,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:40,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 754 statements into 1 equivalence classes. [2025-03-03 20:07:40,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 754 of 754 statements. [2025-03-03 20:07:40,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:40,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:41,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:41,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772758606] [2025-03-03 20:07:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772758606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975242198] [2025-03-03 20:07:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:41,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:41,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:41,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:41,672 INFO L87 Difference]: Start difference. First operand 28933 states and 48388 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:45,620 INFO L93 Difference]: Finished difference Result 90979 states and 150159 transitions. [2025-03-03 20:07:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:45,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 754 [2025-03-03 20:07:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:45,820 INFO L225 Difference]: With dead ends: 90979 [2025-03-03 20:07:45,820 INFO L226 Difference]: Without dead ends: 62049 [2025-03-03 20:07:45,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:07:45,892 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 769 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:45,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1908 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 20:07:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62049 states. [2025-03-03 20:07:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62049 to 61965. [2025-03-03 20:07:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61965 states, 47308 states have (on average 1.5533102223725375) internal successors, (73484), 47756 states have internal predecessors, (73484), 14032 states have call successors, (14032), 624 states have call predecessors, (14032), 624 states have return successors, (14032), 13584 states have call predecessors, (14032), 14032 states have call successors, (14032) [2025-03-03 20:07:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61965 states to 61965 states and 101548 transitions. [2025-03-03 20:07:49,692 INFO L78 Accepts]: Start accepts. Automaton has 61965 states and 101548 transitions. Word has length 754 [2025-03-03 20:07:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:49,693 INFO L471 AbstractCegarLoop]: Abstraction has 61965 states and 101548 transitions. [2025-03-03 20:07:49,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 61965 states and 101548 transitions. [2025-03-03 20:07:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-03 20:07:49,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:49,717 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:07:49,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:49,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1837024075, now seen corresponding path program 1 times [2025-03-03 20:07:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:49,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490895036] [2025-03-03 20:07:49,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:49,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:49,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:07:50,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:07:50,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:50,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:07:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:07:50,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:07:50,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490895036] [2025-03-03 20:07:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490895036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:07:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:07:50,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:07:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304055081] [2025-03-03 20:07:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:07:50,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:07:50,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:07:50,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:07:50,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:07:50,644 INFO L87 Difference]: Start difference. First operand 61965 states and 101548 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:07:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:56,706 INFO L93 Difference]: Finished difference Result 185587 states and 303999 transitions. [2025-03-03 20:07:56,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:07:56,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 755 [2025-03-03 20:07:56,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:57,100 INFO L225 Difference]: With dead ends: 185587 [2025-03-03 20:07:57,101 INFO L226 Difference]: Without dead ends: 123625 [2025-03-03 20:07:57,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:07:57,260 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 940 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:57,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1846 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:07:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123625 states. [2025-03-03 20:08:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123625 to 76973. [2025-03-03 20:08:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76973 states, 62316 states have (on average 1.613774953462995) internal successors, (100564), 62764 states have internal predecessors, (100564), 14032 states have call successors, (14032), 624 states have call predecessors, (14032), 624 states have return successors, (14032), 13584 states have call predecessors, (14032), 14032 states have call successors, (14032) [2025-03-03 20:08:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76973 states to 76973 states and 128628 transitions. [2025-03-03 20:08:02,280 INFO L78 Accepts]: Start accepts. Automaton has 76973 states and 128628 transitions. Word has length 755 [2025-03-03 20:08:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 76973 states and 128628 transitions. [2025-03-03 20:08:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:08:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 76973 states and 128628 transitions. [2025-03-03 20:08:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-03 20:08:02,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:02,306 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:08:02,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:02,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -934449805, now seen corresponding path program 1 times [2025-03-03 20:08:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538714658] [2025-03-03 20:08:02,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:02,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:08:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:08:02,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:02,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:08:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:03,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538714658] [2025-03-03 20:08:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538714658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:03,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:08:03,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602419595] [2025-03-03 20:08:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:03,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:03,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:03,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:03,837 INFO L87 Difference]: Start difference. First operand 76973 states and 128628 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:08:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:07,641 INFO L93 Difference]: Finished difference Result 126263 states and 207163 transitions. [2025-03-03 20:08:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:07,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 755 [2025-03-03 20:08:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:07,879 INFO L225 Difference]: With dead ends: 126263 [2025-03-03 20:08:07,879 INFO L226 Difference]: Without dead ends: 87777 [2025-03-03 20:08:07,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:07,948 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 107 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:07,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2262 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:08:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87777 states. [2025-03-03 20:08:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87777 to 76973. [2025-03-03 20:08:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76973 states, 62316 states have (on average 1.609923615122922) internal successors, (100324), 62764 states have internal predecessors, (100324), 14032 states have call successors, (14032), 624 states have call predecessors, (14032), 624 states have return successors, (14032), 13584 states have call predecessors, (14032), 14032 states have call successors, (14032) [2025-03-03 20:08:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76973 states to 76973 states and 128388 transitions. [2025-03-03 20:08:12,246 INFO L78 Accepts]: Start accepts. Automaton has 76973 states and 128388 transitions. Word has length 755 [2025-03-03 20:08:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:12,247 INFO L471 AbstractCegarLoop]: Abstraction has 76973 states and 128388 transitions. [2025-03-03 20:08:12,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:08:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 76973 states and 128388 transitions. [2025-03-03 20:08:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-03 20:08:12,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:12,271 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:12,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:08:12,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:12,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1553063028, now seen corresponding path program 1 times [2025-03-03 20:08:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427013418] [2025-03-03 20:08:12,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:12,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:08:13,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:08:13,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:13,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 90 proven. 267 refuted. 0 times theorem prover too weak. 28203 trivial. 0 not checked. [2025-03-03 20:08:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427013418] [2025-03-03 20:08:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427013418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225626281] [2025-03-03 20:08:13,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:13,532 INFO L229 MonitoredProcess]: Starting monitored process 3 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:08:13,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:08:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:08:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:08:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:13,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:08:13,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 10859 proven. 267 refuted. 0 times theorem prover too weak. 17434 trivial. 0 not checked. [2025-03-03 20:08:14,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 90 proven. 267 refuted. 0 times theorem prover too weak. 28203 trivial. 0 not checked. [2025-03-03 20:08:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225626281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:14,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:14,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 20:08:14,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148589400] [2025-03-03 20:08:14,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:14,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:08:14,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:14,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:08:14,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:08:14,889 INFO L87 Difference]: Start difference. First operand 76973 states and 128388 transitions. Second operand has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 3 states have call successors, (298), 2 states have call predecessors, (298), 4 states have return successors, (299), 3 states have call predecessors, (299), 3 states have call successors, (299) [2025-03-03 20:08:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:17,883 INFO L93 Difference]: Finished difference Result 133327 states and 221685 transitions. [2025-03-03 20:08:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:08:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 3 states have call successors, (298), 2 states have call predecessors, (298), 4 states have return successors, (299), 3 states have call predecessors, (299), 3 states have call successors, (299) Word has length 755 [2025-03-03 20:08:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:18,072 INFO L225 Difference]: With dead ends: 133327 [2025-03-03 20:08:18,073 INFO L226 Difference]: Without dead ends: 56357 [2025-03-03 20:08:18,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1505 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:08:18,201 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 599 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:18,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2175 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:08:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56357 states. [2025-03-03 20:08:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56357 to 27733. [2025-03-03 20:08:20,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27733 states, 21764 states have (on average 1.5980518287079581) internal successors, (34780), 21908 states have internal predecessors, (34780), 5696 states have call successors, (5696), 272 states have call predecessors, (5696), 272 states have return successors, (5696), 5552 states have call predecessors, (5696), 5696 states have call successors, (5696) [2025-03-03 20:08:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27733 states to 27733 states and 46172 transitions. [2025-03-03 20:08:20,771 INFO L78 Accepts]: Start accepts. Automaton has 27733 states and 46172 transitions. Word has length 755 [2025-03-03 20:08:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:20,772 INFO L471 AbstractCegarLoop]: Abstraction has 27733 states and 46172 transitions. [2025-03-03 20:08:20,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.272727272727273) internal successors, (223), 11 states have internal predecessors, (223), 3 states have call successors, (298), 2 states have call predecessors, (298), 4 states have return successors, (299), 3 states have call predecessors, (299), 3 states have call successors, (299) [2025-03-03 20:08:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27733 states and 46172 transitions. [2025-03-03 20:08:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-03 20:08:20,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:20,780 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:20,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 20:08:20,980 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -467376162, now seen corresponding path program 1 times [2025-03-03 20:08:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672712986] [2025-03-03 20:08:20,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-03 20:08:21,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-03 20:08:21,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:21,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:08:21,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:21,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672712986] [2025-03-03 20:08:21,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672712986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:21,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:21,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:21,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781129235] [2025-03-03 20:08:21,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:21,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:21,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:21,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:21,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:21,289 INFO L87 Difference]: Start difference. First operand 27733 states and 46172 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:08:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:25,918 INFO L93 Difference]: Finished difference Result 105363 states and 175703 transitions. [2025-03-03 20:08:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:25,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) Word has length 756 [2025-03-03 20:08:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:26,156 INFO L225 Difference]: With dead ends: 105363 [2025-03-03 20:08:26,156 INFO L226 Difference]: Without dead ends: 77633 [2025-03-03 20:08:26,238 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:08:26,239 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 857 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:26,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 1512 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77633 states. [2025-03-03 20:08:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77633 to 77581. [2025-03-03 20:08:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77581 states, 62828 states have (on average 1.6103011396192781) internal successors, (101172), 63276 states have internal predecessors, (101172), 14032 states have call successors, (14032), 720 states have call predecessors, (14032), 720 states have return successors, (14032), 13584 states have call predecessors, (14032), 14032 states have call successors, (14032) [2025-03-03 20:08:31,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77581 states to 77581 states and 129236 transitions. [2025-03-03 20:08:31,081 INFO L78 Accepts]: Start accepts. Automaton has 77581 states and 129236 transitions. Word has length 756 [2025-03-03 20:08:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 77581 states and 129236 transitions. [2025-03-03 20:08:31,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 1 states have call predecessors, (120), 1 states have call successors, (120) [2025-03-03 20:08:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 77581 states and 129236 transitions. [2025-03-03 20:08:31,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-03 20:08:31,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:31,099 INFO L218 NwaCegarLoop]: trace histogram [120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:31,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:08:31,100 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:31,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:31,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1484666719, now seen corresponding path program 1 times [2025-03-03 20:08:31,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:31,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512622480] [2025-03-03 20:08:31,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:31,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:31,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-03 20:08:31,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-03 20:08:31,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:31,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 28560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28560 trivial. 0 not checked. [2025-03-03 20:08:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:33,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512622480] [2025-03-03 20:08:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512622480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:33,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:33,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:08:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630256854] [2025-03-03 20:08:33,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:33,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:08:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:08:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:08:33,975 INFO L87 Difference]: Start difference. First operand 77581 states and 129236 transitions. Second operand has 11 states, 11 states have (on average 14.454545454545455) internal successors, (159), 11 states have internal predecessors, (159), 3 states have call successors, (120), 1 states have call predecessors, (120), 1 states have return successors, (120), 3 states have call predecessors, (120), 3 states have call successors, (120)