./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-98.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 bc1a39df1a1f90f10eb4303c02234273e4571ce0919d0ee86bacf184ad56a73f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:24:17,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:24:17,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:24:17,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:24:17,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:24:17,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:24:17,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:24:17,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:24:17,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:24:17,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:24:17,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:24:17,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:24:17,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:24:17,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:24:17,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:24:17,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:24:17,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:24:17,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:24:17,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:24:17,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:24:17,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:24:17,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:24:17,507 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 -> bc1a39df1a1f90f10eb4303c02234273e4571ce0919d0ee86bacf184ad56a73f [2025-03-08 11:24:17,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:24:17,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:24:17,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:24:17,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:24:17,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:24:17,732 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-98.i [2025-03-08 11:24:18,881 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78bceea/bf6ffe7e3eb448e399678d98f7f539e1/FLAG37be98ec7 [2025-03-08 11:24:19,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:24:19,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-98.i [2025-03-08 11:24:19,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78bceea/bf6ffe7e3eb448e399678d98f7f539e1/FLAG37be98ec7 [2025-03-08 11:24:19,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd78bceea/bf6ffe7e3eb448e399678d98f7f539e1 [2025-03-08 11:24:19,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:24:19,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:24:19,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:24:19,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:24:19,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:24:19,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e3e1e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19, skipping insertion in model container [2025-03-08 11:24:19,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:24:19,332 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-98.i[916,929] [2025-03-08 11:24:19,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:24:19,523 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:24:19,531 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-98.i[916,929] [2025-03-08 11:24:19,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:24:19,599 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:24:19,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19 WrapperNode [2025-03-08 11:24:19,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:24:19,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:24:19,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:24:19,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:24:19,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,670 INFO L138 Inliner]: procedures = 26, calls = 115, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 819 [2025-03-08 11:24:19,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:24:19,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:24:19,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:24:19,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:24:19,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,727 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-08 11:24:19,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:24:19,783 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:24:19,783 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:24:19,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:24:19,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (1/1) ... [2025-03-08 11:24:19,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:24:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:24:19,812 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-08 11:24:19,814 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-08 11:24:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:24:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:24:19,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:24:19,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:24:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:24:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:24:19,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:24:19,958 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:24:20,790 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc property_#t~bitwise77#1; [2025-03-08 11:24:20,959 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-08 11:24:20,960 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:24:20,991 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:24:20,991 INFO L336 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-08 11:24:20,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:24:20 BoogieIcfgContainer [2025-03-08 11:24:20,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:24:20,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:24:20,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:24:20,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:24:20,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:24:19" (1/3) ... [2025-03-08 11:24:20,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:24:20, skipping insertion in model container [2025-03-08 11:24:20,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:24:19" (2/3) ... [2025-03-08 11:24:20,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bc630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:24:20, skipping insertion in model container [2025-03-08 11:24:20,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:24:20" (3/3) ... [2025-03-08 11:24:21,000 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-98.i [2025-03-08 11:24:21,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:24:21,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-98.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:24:21,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:24:21,071 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;@1b43bf3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:24:21,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:24:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 242 states have internal predecessors, (384), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:24:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-08 11:24:21,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:21,101 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:21,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:21,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1322030211, now seen corresponding path program 1 times [2025-03-08 11:24:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:21,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099271561] [2025-03-08 11:24:21,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-08 11:24:21,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-08 11:24:21,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:21,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-08 11:24:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099271561] [2025-03-08 11:24:21,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099271561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:24:21,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65465102] [2025-03-08 11:24:21,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:21,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:24:21,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:24:21,712 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-08 11:24:21,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:24:21,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-08 11:24:21,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-08 11:24:21,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:21,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:22,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 1481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:24:22,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:24:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 20402 trivial. 0 not checked. [2025-03-08 11:24:22,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:24:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65465102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:22,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:24:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:24:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121727126] [2025-03-08 11:24:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:24:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:22,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:24:22,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:24:22,129 INFO L87 Difference]: Start difference. First operand has 346 states, 241 states have (on average 1.5933609958506223) internal successors, (384), 242 states have internal predecessors, (384), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-08 11:24:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:22,201 INFO L93 Difference]: Finished difference Result 683 states and 1267 transitions. [2025-03-08 11:24:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:24:22,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) Word has length 656 [2025-03-08 11:24:22,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:22,211 INFO L225 Difference]: With dead ends: 683 [2025-03-08 11:24:22,211 INFO L226 Difference]: Without dead ends: 340 [2025-03-08 11:24:22,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 657 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-08 11:24:22,219 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:22,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:24:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-08 11:24:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-08 11:24:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 236 states have (on average 1.555084745762712) internal successors, (367), 236 states have internal predecessors, (367), 102 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 11:24:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 571 transitions. [2025-03-08 11:24:22,297 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 571 transitions. Word has length 656 [2025-03-08 11:24:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 571 transitions. [2025-03-08 11:24:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 2 states have call successors, (102), 2 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 2 states have call successors, (102) [2025-03-08 11:24:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 571 transitions. [2025-03-08 11:24:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-08 11:24:22,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:22,315 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:22,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:24:22,516 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-08 11:24:22,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:22,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:22,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2128474769, now seen corresponding path program 1 times [2025-03-08 11:24:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93642431] [2025-03-08 11:24:22,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:22,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-08 11:24:22,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-08 11:24:22,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:22,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93642431] [2025-03-08 11:24:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93642431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916482414] [2025-03-08 11:24:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:23,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:23,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:23,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:23,147 INFO L87 Difference]: Start difference. First operand 340 states and 571 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:23,288 INFO L93 Difference]: Finished difference Result 885 states and 1484 transitions. [2025-03-08 11:24:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:23,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 658 [2025-03-08 11:24:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:23,301 INFO L225 Difference]: With dead ends: 885 [2025-03-08 11:24:23,301 INFO L226 Difference]: Without dead ends: 548 [2025-03-08 11:24:23,303 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-08 11:24:23,303 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 345 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:23,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1260 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-03-08 11:24:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2025-03-08 11:24:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 375 states have (on average 1.544) internal successors, (579), 376 states have internal predecessors, (579), 167 states have call successors, (167), 2 states have call predecessors, (167), 2 states have return successors, (167), 166 states have call predecessors, (167), 167 states have call successors, (167) [2025-03-08 11:24:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 913 transitions. [2025-03-08 11:24:23,393 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 913 transitions. Word has length 658 [2025-03-08 11:24:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:23,396 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 913 transitions. [2025-03-08 11:24:23,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 913 transitions. [2025-03-08 11:24:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-08 11:24:23,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:23,407 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:23,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:24:23,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:23,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -721351984, now seen corresponding path program 1 times [2025-03-08 11:24:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:23,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024855721] [2025-03-08 11:24:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:23,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-08 11:24:23,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-08 11:24:23,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:23,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:23,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024855721] [2025-03-08 11:24:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024855721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:23,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252486790] [2025-03-08 11:24:23,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:23,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:23,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:23,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:23,749 INFO L87 Difference]: Start difference. First operand 545 states and 913 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:23,867 INFO L93 Difference]: Finished difference Result 1627 states and 2729 transitions. [2025-03-08 11:24:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:23,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 658 [2025-03-08 11:24:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:23,876 INFO L225 Difference]: With dead ends: 1627 [2025-03-08 11:24:23,876 INFO L226 Difference]: Without dead ends: 1085 [2025-03-08 11:24:23,878 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-08 11:24:23,878 INFO L435 NwaCegarLoop]: 1081 mSDtfsCounter, 561 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:23,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1619 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-08 11:24:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2025-03-08 11:24:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 744 states have (on average 1.5403225806451613) internal successors, (1146), 746 states have internal predecessors, (1146), 334 states have call successors, (334), 4 states have call predecessors, (334), 4 states have return successors, (334), 332 states have call predecessors, (334), 334 states have call successors, (334) [2025-03-08 11:24:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1814 transitions. [2025-03-08 11:24:24,037 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1814 transitions. Word has length 658 [2025-03-08 11:24:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:24,039 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1814 transitions. [2025-03-08 11:24:24,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1814 transitions. [2025-03-08 11:24:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2025-03-08 11:24:24,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:24,051 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:24,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:24:24,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:24,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash 445457828, now seen corresponding path program 1 times [2025-03-08 11:24:24,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:24,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022312192] [2025-03-08 11:24:24,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:24,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:24,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 659 statements into 1 equivalence classes. [2025-03-08 11:24:24,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 659 of 659 statements. [2025-03-08 11:24:24,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:24,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:24,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:24,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022312192] [2025-03-08 11:24:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022312192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:24,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762828215] [2025-03-08 11:24:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:24,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:24,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:24,341 INFO L87 Difference]: Start difference. First operand 1083 states and 1814 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:24,467 INFO L93 Difference]: Finished difference Result 2927 states and 4904 transitions. [2025-03-08 11:24:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:24,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 659 [2025-03-08 11:24:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:24,483 INFO L225 Difference]: With dead ends: 2927 [2025-03-08 11:24:24,484 INFO L226 Difference]: Without dead ends: 1847 [2025-03-08 11:24:24,488 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-08 11:24:24,489 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 320 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:24,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1084 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-03-08 11:24:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1841. [2025-03-08 11:24:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1330 states have (on average 1.5548872180451128) internal successors, (2068), 1336 states have internal predecessors, (2068), 502 states have call successors, (502), 8 states have call predecessors, (502), 8 states have return successors, (502), 496 states have call predecessors, (502), 502 states have call successors, (502) [2025-03-08 11:24:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 3072 transitions. [2025-03-08 11:24:24,662 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 3072 transitions. Word has length 659 [2025-03-08 11:24:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:24,665 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 3072 transitions. [2025-03-08 11:24:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3072 transitions. [2025-03-08 11:24:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:24,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:24,675 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:24:24,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:24,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -821833959, now seen corresponding path program 1 times [2025-03-08 11:24:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:24,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014265679] [2025-03-08 11:24:24,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:24,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:24,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:24,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:24,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014265679] [2025-03-08 11:24:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014265679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:24,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:24,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730597322] [2025-03-08 11:24:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:24,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:24,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:24,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:24,896 INFO L87 Difference]: Start difference. First operand 1841 states and 3072 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:25,096 INFO L93 Difference]: Finished difference Result 4981 states and 8244 transitions. [2025-03-08 11:24:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:25,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:25,117 INFO L225 Difference]: With dead ends: 4981 [2025-03-08 11:24:25,117 INFO L226 Difference]: Without dead ends: 3143 [2025-03-08 11:24:25,121 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-08 11:24:25,123 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 341 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:25,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1096 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:24:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-03-08 11:24:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3139. [2025-03-08 11:24:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 2130 states have (on average 1.4929577464788732) internal successors, (3180), 2144 states have internal predecessors, (3180), 992 states have call successors, (992), 16 states have call predecessors, (992), 16 states have return successors, (992), 978 states have call predecessors, (992), 992 states have call successors, (992) [2025-03-08 11:24:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 5164 transitions. [2025-03-08 11:24:25,352 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 5164 transitions. Word has length 660 [2025-03-08 11:24:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:25,353 INFO L471 AbstractCegarLoop]: Abstraction has 3139 states and 5164 transitions. [2025-03-08 11:24:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 5164 transitions. [2025-03-08 11:24:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:25,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:25,362 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:25,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:24:25,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:25,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:25,367 INFO L85 PathProgramCache]: Analyzing trace with hash 422930522, now seen corresponding path program 1 times [2025-03-08 11:24:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:25,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702620954] [2025-03-08 11:24:25,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:25,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:25,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:25,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:25,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:25,946 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702620954] [2025-03-08 11:24:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702620954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57294238] [2025-03-08 11:24:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:25,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:25,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:25,950 INFO L87 Difference]: Start difference. First operand 3139 states and 5164 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:26,676 INFO L93 Difference]: Finished difference Result 9251 states and 15202 transitions. [2025-03-08 11:24:26,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:24:26,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:26,716 INFO L225 Difference]: With dead ends: 9251 [2025-03-08 11:24:26,716 INFO L226 Difference]: Without dead ends: 6115 [2025-03-08 11:24:26,729 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-08 11:24:26,730 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 859 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:26,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1525 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:24:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6115 states. [2025-03-08 11:24:27,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6115 to 6041. [2025-03-08 11:24:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6041 states, 4024 states have (on average 1.4696819085487078) internal successors, (5914), 4052 states have internal predecessors, (5914), 1984 states have call successors, (1984), 32 states have call predecessors, (1984), 32 states have return successors, (1984), 1956 states have call predecessors, (1984), 1984 states have call successors, (1984) [2025-03-08 11:24:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6041 states to 6041 states and 9882 transitions. [2025-03-08 11:24:27,193 INFO L78 Accepts]: Start accepts. Automaton has 6041 states and 9882 transitions. Word has length 660 [2025-03-08 11:24:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:27,195 INFO L471 AbstractCegarLoop]: Abstraction has 6041 states and 9882 transitions. [2025-03-08 11:24:27,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 6041 states and 9882 transitions. [2025-03-08 11:24:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:27,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:27,204 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:24:27,205 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:27,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash -930379175, now seen corresponding path program 1 times [2025-03-08 11:24:27,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:27,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767862610] [2025-03-08 11:24:27,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:27,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:27,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:27,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767862610] [2025-03-08 11:24:27,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767862610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:27,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:27,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:27,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321750463] [2025-03-08 11:24:27,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:27,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:27,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:27,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:27,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:27,924 INFO L87 Difference]: Start difference. First operand 6041 states and 9882 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:28,603 INFO L93 Difference]: Finished difference Result 16827 states and 27554 transitions. [2025-03-08 11:24:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:28,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:28,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:28,695 INFO L225 Difference]: With dead ends: 16827 [2025-03-08 11:24:28,695 INFO L226 Difference]: Without dead ends: 10789 [2025-03-08 11:24:28,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:28,727 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 344 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:28,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1094 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10789 states. [2025-03-08 11:24:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10789 to 10779. [2025-03-08 11:24:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10779 states, 7242 states have (on average 1.4656172328086163) internal successors, (10614), 7290 states have internal predecessors, (10614), 3478 states have call successors, (3478), 58 states have call predecessors, (3478), 58 states have return successors, (3478), 3430 states have call predecessors, (3478), 3478 states have call successors, (3478) [2025-03-08 11:24:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10779 states to 10779 states and 17570 transitions. [2025-03-08 11:24:29,563 INFO L78 Accepts]: Start accepts. Automaton has 10779 states and 17570 transitions. Word has length 660 [2025-03-08 11:24:29,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 10779 states and 17570 transitions. [2025-03-08 11:24:29,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 10779 states and 17570 transitions. [2025-03-08 11:24:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:29,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:29,578 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:29,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:24:29,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:29,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash 424370713, now seen corresponding path program 1 times [2025-03-08 11:24:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238592993] [2025-03-08 11:24:29,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:30,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:30,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238592993] [2025-03-08 11:24:30,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238592993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:30,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:30,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:24:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4810094] [2025-03-08 11:24:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:30,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:24:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:30,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:24:30,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:24:30,175 INFO L87 Difference]: Start difference. First operand 10779 states and 17570 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:31,247 INFO L93 Difference]: Finished difference Result 32331 states and 52704 transitions. [2025-03-08 11:24:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:24:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:31,367 INFO L225 Difference]: With dead ends: 32331 [2025-03-08 11:24:31,367 INFO L226 Difference]: Without dead ends: 21555 [2025-03-08 11:24:31,424 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-08 11:24:31,424 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 341 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:31,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1102 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:24:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21555 states. [2025-03-08 11:24:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21555 to 21049. [2025-03-08 11:24:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21049 states, 13976 states have (on average 1.4625071551230682) internal successors, (20440), 14072 states have internal predecessors, (20440), 6956 states have call successors, (6956), 116 states have call predecessors, (6956), 116 states have return successors, (6956), 6860 states have call predecessors, (6956), 6956 states have call successors, (6956) [2025-03-08 11:24:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21049 states to 21049 states and 34352 transitions. [2025-03-08 11:24:32,895 INFO L78 Accepts]: Start accepts. Automaton has 21049 states and 34352 transitions. Word has length 660 [2025-03-08 11:24:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:32,896 INFO L471 AbstractCegarLoop]: Abstraction has 21049 states and 34352 transitions. [2025-03-08 11:24:32,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 21049 states and 34352 transitions. [2025-03-08 11:24:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:32,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:32,907 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:32,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:24:32,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:32,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:32,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1652838630, now seen corresponding path program 1 times [2025-03-08 11:24:32,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:32,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482755874] [2025-03-08 11:24:32,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:32,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:32,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:33,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:34,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:34,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482755874] [2025-03-08 11:24:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482755874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:34,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:34,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:24:34,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687083662] [2025-03-08 11:24:34,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:34,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:24:34,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:34,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:24:34,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:24:34,171 INFO L87 Difference]: Start difference. First operand 21049 states and 34352 transitions. Second operand has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:43,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:43,166 INFO L93 Difference]: Finished difference Result 130721 states and 212578 transitions. [2025-03-08 11:24:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:24:43,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:43,767 INFO L225 Difference]: With dead ends: 130721 [2025-03-08 11:24:43,767 INFO L226 Difference]: Without dead ends: 109675 [2025-03-08 11:24:43,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:24:43,931 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 2831 mSDsluCounter, 3827 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 1085 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2831 SdHoareTripleChecker+Valid, 4458 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1085 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:43,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2831 Valid, 4458 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1085 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 11:24:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109675 states. [2025-03-08 11:24:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109675 to 57281. [2025-03-08 11:24:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57281 states, 39120 states have (on average 1.4738241308793456) internal successors, (57656), 39440 states have internal predecessors, (57656), 17820 states have call successors, (17820), 340 states have call predecessors, (17820), 340 states have return successors, (17820), 17500 states have call predecessors, (17820), 17820 states have call successors, (17820) [2025-03-08 11:24:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57281 states to 57281 states and 93296 transitions. [2025-03-08 11:24:49,601 INFO L78 Accepts]: Start accepts. Automaton has 57281 states and 93296 transitions. Word has length 660 [2025-03-08 11:24:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:49,602 INFO L471 AbstractCegarLoop]: Abstraction has 57281 states and 93296 transitions. [2025-03-08 11:24:49,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.0) internal successors, (153), 9 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 57281 states and 93296 transitions. [2025-03-08 11:24:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:24:49,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:49,638 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:24:49,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:24:49,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:49,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1861536933, now seen corresponding path program 1 times [2025-03-08 11:24:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:49,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617150833] [2025-03-08 11:24:49,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:49,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:24:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:24:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:24:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617150833] [2025-03-08 11:24:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617150833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:24:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:24:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:24:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694760528] [2025-03-08 11:24:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:24:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:24:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:50,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:24:50,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:24:50,319 INFO L87 Difference]: Start difference. First operand 57281 states and 93296 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:24:56,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:24:56,027 INFO L93 Difference]: Finished difference Result 150811 states and 246443 transitions. [2025-03-08 11:24:56,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:24:56,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) Word has length 660 [2025-03-08 11:24:56,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:24:56,426 INFO L225 Difference]: With dead ends: 150811 [2025-03-08 11:24:56,426 INFO L226 Difference]: Without dead ends: 93533 [2025-03-08 11:24:56,613 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-08 11:24:56,614 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 942 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:24:56,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2652 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:24:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93533 states. [2025-03-08 11:25:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93533 to 57281. [2025-03-08 11:25:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57281 states, 39120 states have (on average 1.4695296523517383) internal successors, (57488), 39440 states have internal predecessors, (57488), 17820 states have call successors, (17820), 340 states have call predecessors, (17820), 340 states have return successors, (17820), 17500 states have call predecessors, (17820), 17820 states have call successors, (17820) [2025-03-08 11:25:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57281 states to 57281 states and 93128 transitions. [2025-03-08 11:25:01,664 INFO L78 Accepts]: Start accepts. Automaton has 57281 states and 93128 transitions. Word has length 660 [2025-03-08 11:25:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:25:01,665 INFO L471 AbstractCegarLoop]: Abstraction has 57281 states and 93128 transitions. [2025-03-08 11:25:01,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102) [2025-03-08 11:25:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 57281 states and 93128 transitions. [2025-03-08 11:25:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-08 11:25:01,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:25:01,689 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:25:01,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:25:01,690 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:25:01,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:25:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2024606138, now seen corresponding path program 1 times [2025-03-08 11:25:01,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:25:01,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939370304] [2025-03-08 11:25:01,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:25:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:25:01,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes. [2025-03-08 11:25:01,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements. [2025-03-08 11:25:01,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:25:01,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:25:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20604 trivial. 0 not checked. [2025-03-08 11:25:07,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:25:07,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939370304] [2025-03-08 11:25:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939370304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:25:07,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:25:07,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-08 11:25:07,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475590855] [2025-03-08 11:25:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:25:07,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 11:25:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:25:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 11:25:07,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:25:07,939 INFO L87 Difference]: Start difference. First operand 57281 states and 93128 transitions. Second operand has 20 states, 20 states have (on average 7.65) internal successors, (153), 20 states have internal predecessors, (153), 1 states have call successors, (102), 1 states have call predecessors, (102), 1 states have return successors, (102), 1 states have call predecessors, (102), 1 states have call successors, (102)