./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.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_operatoramount_amount250_file-18.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 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:19:39,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:19:39,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:19:39,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:19:39,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:19:39,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:19:39,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:19:39,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:19:39,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:19:39,956 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:19:39,956 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:19:39,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:19:39,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:19:39,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:19:39,959 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:19:39,959 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:19:39,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:19:39,959 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 -> 307330b5784102094d6e331f59192507d431682cdaaa70e5c84c83c1216c8289 [2025-03-08 15:19:40,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:19:40,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:19:40,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:19:40,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:19:40,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:19:40,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i [2025-03-08 15:19:41,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3595f750/cac4825e35224aeca32c5d4dbfd85ca6/FLAG03aaba077 [2025-03-08 15:19:41,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:19:41,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-18.i [2025-03-08 15:19:41,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3595f750/cac4825e35224aeca32c5d4dbfd85ca6/FLAG03aaba077 [2025-03-08 15:19:41,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3595f750/cac4825e35224aeca32c5d4dbfd85ca6 [2025-03-08 15:19:41,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:19:41,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:19:41,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:19:41,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:19:41,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:19:41,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:19:41" (1/1) ... [2025-03-08 15:19:41,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:41, skipping insertion in model container [2025-03-08 15:19:41,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:19:41" (1/1) ... [2025-03-08 15:19:41,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:19:41,941 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_operatoramount_amount250_file-18.i[916,929] [2025-03-08 15:19:42,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:19:42,088 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:19:42,097 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_operatoramount_amount250_file-18.i[916,929] [2025-03-08 15:19:42,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:19:42,173 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:19:42,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42 WrapperNode [2025-03-08 15:19:42,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:19:42,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:19:42,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:19:42,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:19:42,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,250 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-03-08 15:19:42,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:19:42,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:19:42,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:19:42,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:19:42,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,304 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 15:19:42,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,331 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:19:42,349 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:19:42,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:19:42,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:19:42,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (1/1) ... [2025-03-08 15:19:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:19:42,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:19:42,371 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 15:19:42,374 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 15:19:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:19:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:19:42,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:19:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:19:42,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:19:42,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:19:42,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:19:42,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:19:43,108 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L400: havoc property_#t~bitwise35#1;havoc property_#t~short36#1;havoc property_#t~bitwise37#1;havoc property_#t~short38#1;havoc property_#t~ite40#1;havoc property_#t~bitwise39#1;havoc property_#t~short41#1;havoc property_#t~ite43#1;havoc property_#t~bitwise42#1;havoc property_#t~short44#1; [2025-03-08 15:19:43,173 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-08 15:19:43,173 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:19:43,194 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:19:43,196 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:19:43,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:19:43 BoogieIcfgContainer [2025-03-08 15:19:43,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:19:43,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:19:43,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:19:43,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:19:43,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:19:41" (1/3) ... [2025-03-08 15:19:43,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4b0e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:19:43, skipping insertion in model container [2025-03-08 15:19:43,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:19:42" (2/3) ... [2025-03-08 15:19:43,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4b0e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:19:43, skipping insertion in model container [2025-03-08 15:19:43,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:19:43" (3/3) ... [2025-03-08 15:19:43,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-18.i [2025-03-08 15:19:43,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:19:43,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-18.i that has 2 procedures, 202 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:19:43,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:19:43,274 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;@423127ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:19:43,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:19:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 149 states have internal predecessors, (227), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:19:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:19:43,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:43,290 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:43,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1663338197, now seen corresponding path program 1 times [2025-03-08 15:19:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:43,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184207860] [2025-03-08 15:19:43,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:43,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:19:43,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:19:43,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:19:43,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184207860] [2025-03-08 15:19:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184207860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:19:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809451870] [2025-03-08 15:19:43,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:19:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:19:43,721 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 15:19:43,723 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 15:19:43,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:19:43,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:19:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:43,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:43,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:19:43,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:19:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 5000 trivial. 0 not checked. [2025-03-08 15:19:43,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:19:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809451870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:19:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:19:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959111463] [2025-03-08 15:19:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:19:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:19:44,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:19:44,008 INFO L87 Difference]: Start difference. First operand has 202 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 149 states have internal predecessors, (227), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:19:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:44,052 INFO L93 Difference]: Finished difference Result 398 states and 704 transitions. [2025-03-08 15:19:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:19:44,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) Word has length 342 [2025-03-08 15:19:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:44,063 INFO L225 Difference]: With dead ends: 398 [2025-03-08 15:19:44,063 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 15:19:44,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 343 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 15:19:44,067 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:44,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:19:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 15:19:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-08 15:19:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 146 states have (on average 1.5068493150684932) internal successors, (220), 146 states have internal predecessors, (220), 51 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 15:19:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 322 transitions. [2025-03-08 15:19:44,105 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 322 transitions. Word has length 342 [2025-03-08 15:19:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:44,105 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 322 transitions. [2025-03-08 15:19:44,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (51), 2 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:19:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 322 transitions. [2025-03-08 15:19:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:19:44,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:44,110 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:44,117 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 15:19:44,311 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 15:19:44,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:44,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1247734382, now seen corresponding path program 1 times [2025-03-08 15:19:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:44,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146829775] [2025-03-08 15:19:44,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:44,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:44,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:19:44,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:19:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146829775] [2025-03-08 15:19:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146829775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:19:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787788070] [2025-03-08 15:19:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:19:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:19:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:19:44,642 INFO L87 Difference]: Start difference. First operand 199 states and 322 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:44,763 INFO L93 Difference]: Finished difference Result 585 states and 950 transitions. [2025-03-08 15:19:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:19:44,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-08 15:19:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:44,771 INFO L225 Difference]: With dead ends: 585 [2025-03-08 15:19:44,771 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 15:19:44,772 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 15:19:44,773 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 282 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:44,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 651 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:19:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 15:19:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2025-03-08 15:19:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 280 states have (on average 1.4892857142857143) internal successors, (417), 280 states have internal predecessors, (417), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:19:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 621 transitions. [2025-03-08 15:19:44,851 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 621 transitions. Word has length 342 [2025-03-08 15:19:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:44,853 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 621 transitions. [2025-03-08 15:19:44,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 621 transitions. [2025-03-08 15:19:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:19:44,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:44,858 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:44,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:19:44,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1962578860, now seen corresponding path program 1 times [2025-03-08 15:19:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368280049] [2025-03-08 15:19:44,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:44,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:19:44,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:19:44,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:44,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:45,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368280049] [2025-03-08 15:19:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368280049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:19:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425994180] [2025-03-08 15:19:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:19:45,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:19:45,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:19:45,098 INFO L87 Difference]: Start difference. First operand 385 states and 621 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:45,233 INFO L93 Difference]: Finished difference Result 1143 states and 1845 transitions. [2025-03-08 15:19:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:19:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 342 [2025-03-08 15:19:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:45,240 INFO L225 Difference]: With dead ends: 1143 [2025-03-08 15:19:45,241 INFO L226 Difference]: Without dead ends: 761 [2025-03-08 15:19:45,242 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 15:19:45,244 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 311 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:45,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 911 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:19:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-08 15:19:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 387. [2025-03-08 15:19:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 282 states have (on average 1.4858156028368794) internal successors, (419), 282 states have internal predecessors, (419), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:19:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 623 transitions. [2025-03-08 15:19:45,298 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 623 transitions. Word has length 342 [2025-03-08 15:19:45,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:45,299 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 623 transitions. [2025-03-08 15:19:45,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 623 transitions. [2025-03-08 15:19:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-08 15:19:45,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:45,302 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:45,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:19:45,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:45,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -622841395, now seen corresponding path program 1 times [2025-03-08 15:19:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181422866] [2025-03-08 15:19:45,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-08 15:19:45,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-08 15:19:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:45,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:45,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181422866] [2025-03-08 15:19:45,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181422866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:45,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:45,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:19:45,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293511185] [2025-03-08 15:19:45,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:19:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:19:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:19:45,667 INFO L87 Difference]: Start difference. First operand 387 states and 623 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:19:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:45,734 INFO L93 Difference]: Finished difference Result 771 states and 1243 transitions. [2025-03-08 15:19:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:19:45,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 342 [2025-03-08 15:19:45,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:45,740 INFO L225 Difference]: With dead ends: 771 [2025-03-08 15:19:45,741 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 15:19:45,742 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 15:19:45,744 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:45,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 302 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:19:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 15:19:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2025-03-08 15:19:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 280 states have (on average 1.4821428571428572) internal successors, (415), 280 states have internal predecessors, (415), 102 states have call successors, (102), 2 states have call predecessors, (102), 2 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 15:19:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 619 transitions. [2025-03-08 15:19:45,786 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 619 transitions. Word has length 342 [2025-03-08 15:19:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:45,789 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 619 transitions. [2025-03-08 15:19:45,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-08 15:19:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 619 transitions. [2025-03-08 15:19:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:19:45,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:45,794 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:19:45,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:45,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1461321669, now seen corresponding path program 1 times [2025-03-08 15:19:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:45,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281225430] [2025-03-08 15:19:45,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:45,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:19:46,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:19:46,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:46,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281225430] [2025-03-08 15:19:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281225430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:46,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:19:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132175141] [2025-03-08 15:19:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:46,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:19:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:46,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:19:46,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:19:46,613 INFO L87 Difference]: Start difference. First operand 385 states and 619 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:19:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:46,976 INFO L93 Difference]: Finished difference Result 1056 states and 1699 transitions. [2025-03-08 15:19:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:19:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 343 [2025-03-08 15:19:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:46,981 INFO L225 Difference]: With dead ends: 1056 [2025-03-08 15:19:46,981 INFO L226 Difference]: Without dead ends: 674 [2025-03-08 15:19:46,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:19:46,983 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 543 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:46,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 893 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:19:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-08 15:19:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 471. [2025-03-08 15:19:47,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 314 states have (on average 1.4331210191082802) internal successors, (450), 314 states have internal predecessors, (450), 153 states have call successors, (153), 3 states have call predecessors, (153), 3 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-08 15:19:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 756 transitions. [2025-03-08 15:19:47,050 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 756 transitions. Word has length 343 [2025-03-08 15:19:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:47,052 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 756 transitions. [2025-03-08 15:19:47,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:19:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 756 transitions. [2025-03-08 15:19:47,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:19:47,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:47,056 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:19:47,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:47,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash -39737432, now seen corresponding path program 1 times [2025-03-08 15:19:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549721374] [2025-03-08 15:19:47,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:47,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:19:47,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:19:47,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:47,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549721374] [2025-03-08 15:19:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549721374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:19:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978277472] [2025-03-08 15:19:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:48,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:19:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:48,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:19:48,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:19:48,098 INFO L87 Difference]: Start difference. First operand 471 states and 756 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:48,471 INFO L93 Difference]: Finished difference Result 1353 states and 2127 transitions. [2025-03-08 15:19:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:19:48,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:19:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:48,478 INFO L225 Difference]: With dead ends: 1353 [2025-03-08 15:19:48,478 INFO L226 Difference]: Without dead ends: 971 [2025-03-08 15:19:48,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:19:48,481 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 591 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:48,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 815 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:19:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-08 15:19:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 701. [2025-03-08 15:19:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 514 states have (on average 1.4669260700389104) internal successors, (754), 516 states have internal predecessors, (754), 181 states have call successors, (181), 5 states have call predecessors, (181), 5 states have return successors, (181), 179 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-08 15:19:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1116 transitions. [2025-03-08 15:19:48,564 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1116 transitions. Word has length 343 [2025-03-08 15:19:48,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:48,564 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1116 transitions. [2025-03-08 15:19:48,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1116 transitions. [2025-03-08 15:19:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:19:48,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:48,570 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:48,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:19:48,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -550271609, now seen corresponding path program 1 times [2025-03-08 15:19:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:48,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456998570] [2025-03-08 15:19:48,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:48,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:19:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:19:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:19:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:19:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:19:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456998570] [2025-03-08 15:19:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456998570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:19:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:19:49,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:19:49,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470276241] [2025-03-08 15:19:49,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:19:49,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:19:49,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:19:49,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:19:49,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:19:49,476 INFO L87 Difference]: Start difference. First operand 701 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:19:50,298 INFO L93 Difference]: Finished difference Result 3075 states and 4892 transitions. [2025-03-08 15:19:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:19:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:19:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:19:50,311 INFO L225 Difference]: With dead ends: 3075 [2025-03-08 15:19:50,311 INFO L226 Difference]: Without dead ends: 2463 [2025-03-08 15:19:50,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:19:50,314 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 687 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:19:50,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 1298 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:19:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-03-08 15:19:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 1557. [2025-03-08 15:19:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1236 states have (on average 1.5024271844660195) internal successors, (1857), 1240 states have internal predecessors, (1857), 311 states have call successors, (311), 9 states have call predecessors, (311), 9 states have return successors, (311), 307 states have call predecessors, (311), 311 states have call successors, (311) [2025-03-08 15:19:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2479 transitions. [2025-03-08 15:19:50,430 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2479 transitions. Word has length 343 [2025-03-08 15:19:50,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:19:50,431 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2479 transitions. [2025-03-08 15:19:50,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:19:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2479 transitions. [2025-03-08 15:19:50,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:19:50,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:19:50,435 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:50,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:19:50,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:19:50,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:19:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1547343962, now seen corresponding path program 1 times [2025-03-08 15:19:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:19:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132795899] [2025-03-08 15:19:50,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:19:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:19:50,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:19:50,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:19:50,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:19:50,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:07,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132795899] [2025-03-08 15:20:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132795899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835732774] [2025-03-08 15:20:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:07,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:07,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:07,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:07,010 INFO L87 Difference]: Start difference. First operand 1557 states and 2479 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:08,548 INFO L93 Difference]: Finished difference Result 4773 states and 7540 transitions. [2025-03-08 15:20:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:08,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:08,567 INFO L225 Difference]: With dead ends: 4773 [2025-03-08 15:20:08,567 INFO L226 Difference]: Without dead ends: 3305 [2025-03-08 15:20:08,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:08,572 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 369 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:08,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1665 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:20:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-03-08 15:20:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 1677. [2025-03-08 15:20:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1356 states have (on average 1.502212389380531) internal successors, (2037), 1360 states have internal predecessors, (2037), 311 states have call successors, (311), 9 states have call predecessors, (311), 9 states have return successors, (311), 307 states have call predecessors, (311), 311 states have call successors, (311) [2025-03-08 15:20:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2659 transitions. [2025-03-08 15:20:08,716 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2659 transitions. Word has length 343 [2025-03-08 15:20:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:08,716 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2659 transitions. [2025-03-08 15:20:08,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2659 transitions. [2025-03-08 15:20:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:08,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:08,720 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:20:08,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1416613287, now seen corresponding path program 1 times [2025-03-08 15:20:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392478653] [2025-03-08 15:20:08,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:08,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:09,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:09,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:09,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:30,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392478653] [2025-03-08 15:20:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392478653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878032646] [2025-03-08 15:20:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:30,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:30,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:30,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:30,083 INFO L87 Difference]: Start difference. First operand 1677 states and 2659 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:30,764 INFO L93 Difference]: Finished difference Result 5147 states and 8084 transitions. [2025-03-08 15:20:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:30,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:30,781 INFO L225 Difference]: With dead ends: 5147 [2025-03-08 15:20:30,781 INFO L226 Difference]: Without dead ends: 3559 [2025-03-08 15:20:30,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:30,788 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 392 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:30,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1024 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:20:30,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2025-03-08 15:20:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 2175. [2025-03-08 15:20:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 1830 states have (on average 1.4781420765027322) internal successors, (2705), 1842 states have internal predecessors, (2705), 327 states have call successors, (327), 17 states have call predecessors, (327), 17 states have return successors, (327), 315 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 15:20:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3359 transitions. [2025-03-08 15:20:30,922 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3359 transitions. Word has length 343 [2025-03-08 15:20:30,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:30,922 INFO L471 AbstractCegarLoop]: Abstraction has 2175 states and 3359 transitions. [2025-03-08 15:20:30,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3359 transitions. [2025-03-08 15:20:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:30,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:30,926 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:30,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:20:30,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:30,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -90993243, now seen corresponding path program 1 times [2025-03-08 15:20:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638483494] [2025-03-08 15:20:30,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:30,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:30,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:30,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:30,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638483494] [2025-03-08 15:20:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638483494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:20:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417579267] [2025-03-08 15:20:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:20:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:31,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:20:31,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:31,499 INFO L87 Difference]: Start difference. First operand 2175 states and 3359 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:31,971 INFO L93 Difference]: Finished difference Result 5650 states and 8645 transitions. [2025-03-08 15:20:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:20:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:31,985 INFO L225 Difference]: With dead ends: 5650 [2025-03-08 15:20:31,985 INFO L226 Difference]: Without dead ends: 3564 [2025-03-08 15:20:31,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:31,990 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 684 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:31,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1111 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:20:31,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2025-03-08 15:20:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2364. [2025-03-08 15:20:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2019 states have (on average 1.4947994056463596) internal successors, (3018), 2031 states have internal predecessors, (3018), 327 states have call successors, (327), 17 states have call predecessors, (327), 17 states have return successors, (327), 315 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 15:20:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3672 transitions. [2025-03-08 15:20:32,099 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3672 transitions. Word has length 343 [2025-03-08 15:20:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:32,100 INFO L471 AbstractCegarLoop]: Abstraction has 2364 states and 3672 transitions. [2025-03-08 15:20:32,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3672 transitions. [2025-03-08 15:20:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:32,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:32,104 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:20:32,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:32,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 10716709, now seen corresponding path program 1 times [2025-03-08 15:20:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23126194] [2025-03-08 15:20:32,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:32,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:32,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:32,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:32,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:32,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23126194] [2025-03-08 15:20:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23126194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:20:32,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276826823] [2025-03-08 15:20:32,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:20:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:32,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:20:32,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:20:32,192 INFO L87 Difference]: Start difference. First operand 2364 states and 3672 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:32,339 INFO L93 Difference]: Finished difference Result 5910 states and 9202 transitions. [2025-03-08 15:20:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:20:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:32,353 INFO L225 Difference]: With dead ends: 5910 [2025-03-08 15:20:32,353 INFO L226 Difference]: Without dead ends: 3635 [2025-03-08 15:20:32,357 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 15:20:32,358 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 314 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:32,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 685 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:20:32,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2025-03-08 15:20:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3607. [2025-03-08 15:20:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 2994 states have (on average 1.482631930527722) internal successors, (4439), 3010 states have internal predecessors, (4439), 587 states have call successors, (587), 25 states have call predecessors, (587), 25 states have return successors, (587), 571 states have call predecessors, (587), 587 states have call successors, (587) [2025-03-08 15:20:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 5613 transitions. [2025-03-08 15:20:32,522 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 5613 transitions. Word has length 343 [2025-03-08 15:20:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:32,522 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 5613 transitions. [2025-03-08 15:20:32,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 5613 transitions. [2025-03-08 15:20:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:32,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:32,526 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:32,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:20:32,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -499817468, now seen corresponding path program 1 times [2025-03-08 15:20:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:32,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692516869] [2025-03-08 15:20:32,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:32,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:32,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:32,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:32,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:40,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:40,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692516869] [2025-03-08 15:20:40,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692516869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:40,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:40,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:40,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371851760] [2025-03-08 15:20:40,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:40,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:40,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:40,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:40,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:40,694 INFO L87 Difference]: Start difference. First operand 3607 states and 5613 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:41,437 INFO L93 Difference]: Finished difference Result 9419 states and 14728 transitions. [2025-03-08 15:20:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:41,473 INFO L225 Difference]: With dead ends: 9419 [2025-03-08 15:20:41,473 INFO L226 Difference]: Without dead ends: 5901 [2025-03-08 15:20:41,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:20:41,483 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 376 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:41,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1108 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:20:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2025-03-08 15:20:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 4885. [2025-03-08 15:20:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4885 states, 3744 states have (on average 1.4324252136752136) internal successors, (5363), 3768 states have internal predecessors, (5363), 1091 states have call successors, (1091), 49 states have call predecessors, (1091), 49 states have return successors, (1091), 1067 states have call predecessors, (1091), 1091 states have call successors, (1091) [2025-03-08 15:20:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4885 states to 4885 states and 7545 transitions. [2025-03-08 15:20:42,014 INFO L78 Accepts]: Start accepts. Automaton has 4885 states and 7545 transitions. Word has length 343 [2025-03-08 15:20:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:42,014 INFO L471 AbstractCegarLoop]: Abstraction has 4885 states and 7545 transitions. [2025-03-08 15:20:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4885 states and 7545 transitions. [2025-03-08 15:20:42,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:42,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:42,026 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:42,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:20:42,027 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1734591846, now seen corresponding path program 1 times [2025-03-08 15:20:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653198830] [2025-03-08 15:20:42,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:42,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:42,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:42,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:42,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653198830] [2025-03-08 15:20:48,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653198830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:48,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:48,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 15:20:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062077279] [2025-03-08 15:20:48,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:48,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:20:48,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:48,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:20:48,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:20:48,468 INFO L87 Difference]: Start difference. First operand 4885 states and 7545 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:20:53,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:53,078 INFO L93 Difference]: Finished difference Result 21853 states and 33453 transitions. [2025-03-08 15:20:53,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:20:53,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 343 [2025-03-08 15:20:53,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:53,130 INFO L225 Difference]: With dead ends: 21853 [2025-03-08 15:20:53,130 INFO L226 Difference]: Without dead ends: 17057 [2025-03-08 15:20:53,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:20:53,144 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 1254 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:53,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 1950 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 15:20:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17057 states. [2025-03-08 15:20:54,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17057 to 13061. [2025-03-08 15:20:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13061 states, 10544 states have (on average 1.4437594840667678) internal successors, (15223), 10632 states have internal predecessors, (15223), 2371 states have call successors, (2371), 145 states have call predecessors, (2371), 145 states have return successors, (2371), 2283 states have call predecessors, (2371), 2371 states have call successors, (2371) [2025-03-08 15:20:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13061 states to 13061 states and 19965 transitions. [2025-03-08 15:20:54,487 INFO L78 Accepts]: Start accepts. Automaton has 13061 states and 19965 transitions. Word has length 343 [2025-03-08 15:20:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:54,488 INFO L471 AbstractCegarLoop]: Abstraction has 13061 states and 19965 transitions. [2025-03-08 15:20:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 15:20:54,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13061 states and 19965 transitions. [2025-03-08 15:20:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:54,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:54,499 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:54,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:20:54,499 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:54,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 860607911, now seen corresponding path program 1 times [2025-03-08 15:20:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814531797] [2025-03-08 15:20:54,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:54,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:54,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:54,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:54,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814531797] [2025-03-08 15:20:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814531797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:20:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497278884] [2025-03-08 15:20:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:54,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:20:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:54,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:20:54,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:20:54,842 INFO L87 Difference]: Start difference. First operand 13061 states and 19965 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:20:56,408 INFO L93 Difference]: Finished difference Result 24932 states and 38083 transitions. [2025-03-08 15:20:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:20:56,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:20:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:20:56,467 INFO L225 Difference]: With dead ends: 24932 [2025-03-08 15:20:56,467 INFO L226 Difference]: Without dead ends: 19466 [2025-03-08 15:20:56,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:20:56,484 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 322 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:20:56,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1123 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:20:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19466 states. [2025-03-08 15:20:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19466 to 13087. [2025-03-08 15:20:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13087 states, 10570 states have (on average 1.4440870387890254) internal successors, (15264), 10658 states have internal predecessors, (15264), 2371 states have call successors, (2371), 145 states have call predecessors, (2371), 145 states have return successors, (2371), 2283 states have call predecessors, (2371), 2371 states have call successors, (2371) [2025-03-08 15:20:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13087 states to 13087 states and 20006 transitions. [2025-03-08 15:20:57,711 INFO L78 Accepts]: Start accepts. Automaton has 13087 states and 20006 transitions. Word has length 343 [2025-03-08 15:20:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:20:57,711 INFO L471 AbstractCegarLoop]: Abstraction has 13087 states and 20006 transitions. [2025-03-08 15:20:57,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:20:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13087 states and 20006 transitions. [2025-03-08 15:20:57,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:20:57,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:20:57,723 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:57,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:20:57,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:20:57,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:20:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1424541665, now seen corresponding path program 1 times [2025-03-08 15:20:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:20:57,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313673944] [2025-03-08 15:20:57,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:20:57,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:20:57,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:20:57,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:20:57,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:20:57,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:20:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:20:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:20:58,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313673944] [2025-03-08 15:20:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313673944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:20:58,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:20:58,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:20:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704258589] [2025-03-08 15:20:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:20:58,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:20:58,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:20:58,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:20:58,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:20:58,502 INFO L87 Difference]: Start difference. First operand 13087 states and 20006 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:00,678 INFO L93 Difference]: Finished difference Result 31377 states and 47909 transitions. [2025-03-08 15:21:00,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:21:00,679 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:21:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:00,729 INFO L225 Difference]: With dead ends: 31377 [2025-03-08 15:21:00,729 INFO L226 Difference]: Without dead ends: 18405 [2025-03-08 15:21:00,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:21:00,757 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 771 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:00,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 1924 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:21:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18405 states. [2025-03-08 15:21:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18405 to 13112. [2025-03-08 15:21:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13112 states, 10595 states have (on average 1.4442661632845681) internal successors, (15302), 10683 states have internal predecessors, (15302), 2371 states have call successors, (2371), 145 states have call predecessors, (2371), 145 states have return successors, (2371), 2283 states have call predecessors, (2371), 2371 states have call successors, (2371) [2025-03-08 15:21:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 20044 transitions. [2025-03-08 15:21:01,954 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 20044 transitions. Word has length 343 [2025-03-08 15:21:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:01,955 INFO L471 AbstractCegarLoop]: Abstraction has 13112 states and 20044 transitions. [2025-03-08 15:21:01,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:01,955 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 20044 transitions. [2025-03-08 15:21:01,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:21:01,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:01,964 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:21:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:21:01,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:01,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash 501858082, now seen corresponding path program 1 times [2025-03-08 15:21:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:01,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722342388] [2025-03-08 15:21:01,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:21:01,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-08 15:21:02,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-08 15:21:02,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:21:02,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:21:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5100 trivial. 0 not checked. [2025-03-08 15:21:02,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:21:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722342388] [2025-03-08 15:21:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722342388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:21:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:21:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:21:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263826787] [2025-03-08 15:21:02,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:21:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:21:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:21:02,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:21:02,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:21:02,459 INFO L87 Difference]: Start difference. First operand 13112 states and 20044 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:21:03,867 INFO L93 Difference]: Finished difference Result 31845 states and 48503 transitions. [2025-03-08 15:21:03,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:21:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) Word has length 343 [2025-03-08 15:21:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:21:03,928 INFO L225 Difference]: With dead ends: 31845 [2025-03-08 15:21:03,928 INFO L226 Difference]: Without dead ends: 18847 [2025-03-08 15:21:03,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:21:03,953 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 646 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:21:03,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1348 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:21:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2025-03-08 15:21:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 13876. [2025-03-08 15:21:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13876 states, 11358 states have (on average 1.4572107765451665) internal successors, (16551), 11446 states have internal predecessors, (16551), 2371 states have call successors, (2371), 146 states have call predecessors, (2371), 146 states have return successors, (2371), 2283 states have call predecessors, (2371), 2371 states have call successors, (2371) [2025-03-08 15:21:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13876 states to 13876 states and 21293 transitions. [2025-03-08 15:21:05,726 INFO L78 Accepts]: Start accepts. Automaton has 13876 states and 21293 transitions. Word has length 343 [2025-03-08 15:21:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:21:05,727 INFO L471 AbstractCegarLoop]: Abstraction has 13876 states and 21293 transitions. [2025-03-08 15:21:05,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 1 states have call successors, (51), 1 states have call predecessors, (51), 1 states have return successors, (51), 1 states have call predecessors, (51), 1 states have call successors, (51) [2025-03-08 15:21:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 13876 states and 21293 transitions. [2025-03-08 15:21:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-08 15:21:05,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:21:05,739 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:21:05,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:21:05,739 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:21:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:21:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash 603568034, now seen corresponding path program 1 times [2025-03-08 15:21:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:21:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354730214] [2025-03-08 15:21:05,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:21:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms