./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.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 bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:53:32,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:53:32,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:53:32,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:53:32,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:53:32,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:53:32,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:53:32,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:53:32,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:53:32,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:53:32,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:53:32,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:53:32,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:53:32,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:53:32,631 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:53:32,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:53:32,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:53:32,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:53:32,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:53:32,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:53:32,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:53:32,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:53:32,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:53:32,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:53:32,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:53:32,634 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 -> bfa28daccead4025689d4acb7ee77b26ba990cc9e83b74a1022dddbf4091a59b [2025-03-17 02:53:32,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:53:32,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:53:32,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:53:32,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:53:32,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:53:32,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-17 02:53:34,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9c40a34/69003d4f4bb240e3894cadea444fcebd/FLAGe8cd7ce07 [2025-03-17 02:53:34,316 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:53:34,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-17 02:53:34,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9c40a34/69003d4f4bb240e3894cadea444fcebd/FLAGe8cd7ce07 [2025-03-17 02:53:34,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb9c40a34/69003d4f4bb240e3894cadea444fcebd [2025-03-17 02:53:34,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:53:34,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:53:34,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:53:34,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:53:34,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:53:34,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c06ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34, skipping insertion in model container [2025-03-17 02:53:34,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:53:34,498 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_floatingpointinfluence_no-floats_file-33.i[916,929] [2025-03-17 02:53:34,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:53:34,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:53:34,545 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_floatingpointinfluence_no-floats_file-33.i[916,929] [2025-03-17 02:53:34,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:53:34,567 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:53:34,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34 WrapperNode [2025-03-17 02:53:34,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:53:34,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:53:34,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:53:34,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:53:34,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,609 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-17 02:53:34,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:53:34,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:53:34,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:53:34,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:53:34,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,633 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-17 02:53:34,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:53:34,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:53:34,643 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:53:34,643 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:53:34,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (1/1) ... [2025-03-17 02:53:34,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:53:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:53:34,673 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-17 02:53:34,677 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-17 02:53:34,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:53:34,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:53:34,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:53:34,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:53:34,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:53:34,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:53:34,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:53:34,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:53:34,949 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L87: havoc property_#t~bitwise13#1;havoc property_#t~bitwise14#1;havoc property_#t~bitwise15#1;havoc property_#t~short16#1; [2025-03-17 02:53:34,964 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-17 02:53:34,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:53:34,985 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:53:34,985 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:53:34,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:34 BoogieIcfgContainer [2025-03-17 02:53:34,985 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:53:34,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:53:34,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:53:34,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:53:34,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:53:34" (1/3) ... [2025-03-17 02:53:34,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eebe624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:34, skipping insertion in model container [2025-03-17 02:53:34,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:53:34" (2/3) ... [2025-03-17 02:53:34,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eebe624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:53:34, skipping insertion in model container [2025-03-17 02:53:34,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:53:34" (3/3) ... [2025-03-17 02:53:34,993 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2025-03-17 02:53:35,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:53:35,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-33.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:53:35,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:53:35,066 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;@6c48a49b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:53:35,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:53:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:53:35,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:35,078 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:35,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:35,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1089059007, now seen corresponding path program 1 times [2025-03-17 02:53:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169603695] [2025-03-17 02:53:35,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:35,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:35,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 02:53:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169603695] [2025-03-17 02:53:35,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169603695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:53:35,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792192597] [2025-03-17 02:53:35,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:35,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:53:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:53:35,292 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-17 02:53:35,293 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-17 02:53:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:35,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:35,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:35,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:35,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:53:35,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:53:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 02:53:35,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:53:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792192597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:53:35,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:53:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151156665] [2025-03-17 02:53:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:53:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:35,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:53:35,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:53:35,433 INFO L87 Difference]: Start difference. First operand has 64 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 02:53:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:35,467 INFO L93 Difference]: Finished difference Result 125 states and 204 transitions. [2025-03-17 02:53:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:53:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2025-03-17 02:53:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:35,474 INFO L225 Difference]: With dead ends: 125 [2025-03-17 02:53:35,474 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 02:53:35,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-17 02:53:35,481 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:35,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 02:53:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 02:53:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2025-03-17 02:53:35,516 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 86 [2025-03-17 02:53:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:35,516 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2025-03-17 02:53:35,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 02:53:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2025-03-17 02:53:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:53:35,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:35,520 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:35,529 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-17 02:53:35,725 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-17 02:53:35,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1318331583, now seen corresponding path program 1 times [2025-03-17 02:53:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567267364] [2025-03-17 02:53:35,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:35,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:35,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:35,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:35,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567267364] [2025-03-17 02:53:35,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567267364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:35,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:35,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085524155] [2025-03-17 02:53:35,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:35,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:35,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:35,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:35,961 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:35,994 INFO L93 Difference]: Finished difference Result 124 states and 187 transitions. [2025-03-17 02:53:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:35,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-17 02:53:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:35,997 INFO L225 Difference]: With dead ends: 124 [2025-03-17 02:53:35,997 INFO L226 Difference]: Without dead ends: 63 [2025-03-17 02:53:35,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:35,998 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:35,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-17 02:53:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-17 02:53:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2025-03-17 02:53:36,004 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 86 [2025-03-17 02:53:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:36,005 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2025-03-17 02:53:36,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2025-03-17 02:53:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:53:36,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:36,007 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:36,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:53:36,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:36,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash -489122880, now seen corresponding path program 1 times [2025-03-17 02:53:36,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:36,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353994421] [2025-03-17 02:53:36,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:36,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:36,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:36,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:36,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:36,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353994421] [2025-03-17 02:53:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353994421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:36,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:36,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:53:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279323162] [2025-03-17 02:53:36,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:36,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:53:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:36,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:53:36,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:36,161 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:36,346 INFO L93 Difference]: Finished difference Result 152 states and 227 transitions. [2025-03-17 02:53:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:36,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-17 02:53:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:36,349 INFO L225 Difference]: With dead ends: 152 [2025-03-17 02:53:36,349 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 02:53:36,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:36,350 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 90 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:36,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 290 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 02:53:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2025-03-17 02:53:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2025-03-17 02:53:36,364 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 86 [2025-03-17 02:53:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:36,365 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2025-03-17 02:53:36,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2025-03-17 02:53:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:53:36,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:36,368 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:36,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:53:36,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash -360040161, now seen corresponding path program 1 times [2025-03-17 02:53:36,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:36,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695781582] [2025-03-17 02:53:36,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:36,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:36,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:36,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:36,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695781582] [2025-03-17 02:53:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695781582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420505428] [2025-03-17 02:53:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:38,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:38,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:38,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:38,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:38,168 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:38,876 INFO L93 Difference]: Finished difference Result 255 states and 372 transitions. [2025-03-17 02:53:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:38,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-17 02:53:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:38,878 INFO L225 Difference]: With dead ends: 255 [2025-03-17 02:53:38,878 INFO L226 Difference]: Without dead ends: 191 [2025-03-17 02:53:38,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:53:38,879 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 228 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:38,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 386 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:53:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-17 02:53:38,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 83. [2025-03-17 02:53:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2025-03-17 02:53:38,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 86 [2025-03-17 02:53:38,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:38,886 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2025-03-17 02:53:38,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2025-03-17 02:53:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 02:53:38,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:38,887 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:38,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:53:38,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:38,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1357112514, now seen corresponding path program 1 times [2025-03-17 02:53:38,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:38,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425627164] [2025-03-17 02:53:38,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:38,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:38,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 02:53:38,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 02:53:38,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:38,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:39,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:39,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425627164] [2025-03-17 02:53:39,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425627164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:39,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036866003] [2025-03-17 02:53:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:39,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:39,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:39,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:39,198 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:39,406 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2025-03-17 02:53:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2025-03-17 02:53:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:39,408 INFO L225 Difference]: With dead ends: 197 [2025-03-17 02:53:39,408 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 02:53:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:39,409 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 175 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 179 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 02:53:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2025-03-17 02:53:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2025-03-17 02:53:39,414 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 86 [2025-03-17 02:53:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:39,414 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2025-03-17 02:53:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2025-03-17 02:53:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 02:53:39,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:39,415 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:39,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 02:53:39,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:39,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1438959285, now seen corresponding path program 1 times [2025-03-17 02:53:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764897355] [2025-03-17 02:53:39,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 02:53:39,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 02:53:39,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:39,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:39,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764897355] [2025-03-17 02:53:39,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764897355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:39,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:39,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:39,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694267601] [2025-03-17 02:53:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:39,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:39,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:39,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:39,455 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:39,505 INFO L93 Difference]: Finished difference Result 200 states and 296 transitions. [2025-03-17 02:53:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-17 02:53:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:39,507 INFO L225 Difference]: With dead ends: 200 [2025-03-17 02:53:39,507 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 02:53:39,507 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-17 02:53:39,507 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:39,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 186 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 02:53:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2025-03-17 02:53:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-03-17 02:53:39,521 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 87 [2025-03-17 02:53:39,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:39,521 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-03-17 02:53:39,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-03-17 02:53:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 02:53:39,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:39,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:53:39,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:39,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash -858977200, now seen corresponding path program 1 times [2025-03-17 02:53:39,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:39,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909888249] [2025-03-17 02:53:39,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:39,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 02:53:39,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 02:53:39,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:39,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909888249] [2025-03-17 02:53:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909888249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137843963] [2025-03-17 02:53:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:39,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:39,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:39,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:39,558 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:39,598 INFO L93 Difference]: Finished difference Result 211 states and 308 transitions. [2025-03-17 02:53:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:39,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2025-03-17 02:53:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:39,600 INFO L225 Difference]: With dead ends: 211 [2025-03-17 02:53:39,600 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 02:53:39,601 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-17 02:53:39,601 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 78 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:39,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 02:53:39,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 78. [2025-03-17 02:53:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 02:53:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2025-03-17 02:53:39,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 87 [2025-03-17 02:53:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:39,612 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2025-03-17 02:53:39,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2025-03-17 02:53:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:53:39,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:39,614 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:39,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:53:39,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:39,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:39,614 INFO L85 PathProgramCache]: Analyzing trace with hash 273861690, now seen corresponding path program 1 times [2025-03-17 02:53:39,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:39,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164859049] [2025-03-17 02:53:39,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:39,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:53:39,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:53:39,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:39,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:39,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:39,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164859049] [2025-03-17 02:53:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164859049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:39,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451614381] [2025-03-17 02:53:39,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:39,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:39,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:39,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:39,707 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:39,895 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2025-03-17 02:53:39,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:39,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-17 02:53:39,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:39,897 INFO L225 Difference]: With dead ends: 244 [2025-03-17 02:53:39,897 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 02:53:39,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:39,898 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 203 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:39,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 339 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 02:53:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2025-03-17 02:53:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 132 states have internal predecessors, (175), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 02:53:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2025-03-17 02:53:39,918 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 88 [2025-03-17 02:53:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:39,918 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2025-03-17 02:53:39,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2025-03-17 02:53:39,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:53:39,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:39,919 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:39,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:53:39,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:39,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash -19541317, now seen corresponding path program 1 times [2025-03-17 02:53:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:39,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761950252] [2025-03-17 02:53:39,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:39,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:39,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:53:39,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:53:39,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:39,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:40,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:40,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761950252] [2025-03-17 02:53:40,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761950252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:40,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:40,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:53:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163049464] [2025-03-17 02:53:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:40,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:53:40,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:40,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:53:40,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:53:40,491 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:41,093 INFO L93 Difference]: Finished difference Result 472 states and 662 transitions. [2025-03-17 02:53:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-17 02:53:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:41,096 INFO L225 Difference]: With dead ends: 472 [2025-03-17 02:53:41,096 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 02:53:41,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:53:41,097 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 276 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:41,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 386 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:53:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 02:53:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 181. [2025-03-17 02:53:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 150 states have (on average 1.36) internal successors, (204), 152 states have internal predecessors, (204), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 02:53:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2025-03-17 02:53:41,110 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 88 [2025-03-17 02:53:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:41,110 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2025-03-17 02:53:41,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2025-03-17 02:53:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:53:41,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:41,111 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:41,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:53:41,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:41,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -428365542, now seen corresponding path program 1 times [2025-03-17 02:53:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478106984] [2025-03-17 02:53:41,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:41,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:53:41,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:53:41,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:41,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:41,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478106984] [2025-03-17 02:53:41,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478106984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:41,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:41,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:41,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266460] [2025-03-17 02:53:41,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:41,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:41,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:41,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:41,176 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:41,240 INFO L93 Difference]: Finished difference Result 513 states and 725 transitions. [2025-03-17 02:53:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2025-03-17 02:53:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:41,243 INFO L225 Difference]: With dead ends: 513 [2025-03-17 02:53:41,244 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 02:53:41,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:41,245 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 64 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:41,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 172 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 02:53:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 263. [2025-03-17 02:53:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 218 states have (on average 1.3440366972477065) internal successors, (293), 220 states have internal predecessors, (293), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 02:53:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 369 transitions. [2025-03-17 02:53:41,281 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 369 transitions. Word has length 88 [2025-03-17 02:53:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 369 transitions. [2025-03-17 02:53:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 369 transitions. [2025-03-17 02:53:41,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:41,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:41,286 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:41,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:53:41,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1337570707, now seen corresponding path program 1 times [2025-03-17 02:53:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:41,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723703104] [2025-03-17 02:53:41,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:41,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:41,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:41,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:41,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:41,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:41,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:41,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723703104] [2025-03-17 02:53:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723703104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:41,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:41,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621006067] [2025-03-17 02:53:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:41,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:41,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:41,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:41,362 INFO L87 Difference]: Start difference. First operand 263 states and 369 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:41,635 INFO L93 Difference]: Finished difference Result 584 states and 823 transitions. [2025-03-17 02:53:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:41,637 INFO L225 Difference]: With dead ends: 584 [2025-03-17 02:53:41,637 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 02:53:41,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:53:41,638 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 170 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:41,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 355 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 02:53:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 208. [2025-03-17 02:53:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 166 states have (on average 1.3373493975903614) internal successors, (222), 167 states have internal predecessors, (222), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 02:53:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 294 transitions. [2025-03-17 02:53:41,655 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 294 transitions. Word has length 89 [2025-03-17 02:53:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:41,655 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 294 transitions. [2025-03-17 02:53:41,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 294 transitions. [2025-03-17 02:53:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:41,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:41,656 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:41,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 02:53:41,656 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:41,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1630973714, now seen corresponding path program 1 times [2025-03-17 02:53:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047789302] [2025-03-17 02:53:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:41,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:41,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:41,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:41,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:41,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:41,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047789302] [2025-03-17 02:53:41,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047789302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:41,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:41,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:53:41,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146251215] [2025-03-17 02:53:41,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:41,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:53:41,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:41,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:53:41,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:53:41,720 INFO L87 Difference]: Start difference. First operand 208 states and 294 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:41,892 INFO L93 Difference]: Finished difference Result 538 states and 761 transitions. [2025-03-17 02:53:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:53:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:41,895 INFO L225 Difference]: With dead ends: 538 [2025-03-17 02:53:41,895 INFO L226 Difference]: Without dead ends: 432 [2025-03-17 02:53:41,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:53:41,896 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 145 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:41,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 284 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-17 02:53:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 280. [2025-03-17 02:53:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 225 states have internal predecessors, (302), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:53:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 398 transitions. [2025-03-17 02:53:41,915 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 398 transitions. Word has length 89 [2025-03-17 02:53:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:41,915 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 398 transitions. [2025-03-17 02:53:41,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 398 transitions. [2025-03-17 02:53:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:41,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:41,916 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:41,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 02:53:41,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:41,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1960324236, now seen corresponding path program 1 times [2025-03-17 02:53:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860214618] [2025-03-17 02:53:41,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:41,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:41,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:41,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860214618] [2025-03-17 02:53:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860214618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988269888] [2025-03-17 02:53:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:41,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:41,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:41,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:41,970 INFO L87 Difference]: Start difference. First operand 280 states and 398 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:42,103 INFO L93 Difference]: Finished difference Result 547 states and 776 transitions. [2025-03-17 02:53:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:53:42,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:42,105 INFO L225 Difference]: With dead ends: 547 [2025-03-17 02:53:42,105 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 02:53:42,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:42,106 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 131 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:42,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 314 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 02:53:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 281. [2025-03-17 02:53:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 226 states have internal predecessors, (301), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:53:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 397 transitions. [2025-03-17 02:53:42,134 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 397 transitions. Word has length 89 [2025-03-17 02:53:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 397 transitions. [2025-03-17 02:53:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 397 transitions. [2025-03-17 02:53:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:42,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:42,136 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:42,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 02:53:42,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1666921229, now seen corresponding path program 1 times [2025-03-17 02:53:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:42,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099086141] [2025-03-17 02:53:42,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:42,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:42,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:42,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:42,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099086141] [2025-03-17 02:53:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099086141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:53:42,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106869564] [2025-03-17 02:53:42,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:53:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:42,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:53:42,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:42,216 INFO L87 Difference]: Start difference. First operand 281 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:42,486 INFO L93 Difference]: Finished difference Result 697 states and 985 transitions. [2025-03-17 02:53:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:42,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:42,490 INFO L225 Difference]: With dead ends: 697 [2025-03-17 02:53:42,492 INFO L226 Difference]: Without dead ends: 520 [2025-03-17 02:53:42,493 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-17 02:53:42,493 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 239 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:42,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 253 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-17 02:53:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 281. [2025-03-17 02:53:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 226 states have internal predecessors, (301), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:53:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 397 transitions. [2025-03-17 02:53:42,527 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 397 transitions. Word has length 89 [2025-03-17 02:53:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 397 transitions. [2025-03-17 02:53:42,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 397 transitions. [2025-03-17 02:53:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:42,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:42,530 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:42,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 02:53:42,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:42,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:42,530 INFO L85 PathProgramCache]: Analyzing trace with hash -211974902, now seen corresponding path program 1 times [2025-03-17 02:53:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438172444] [2025-03-17 02:53:42,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:42,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:42,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:42,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:42,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:42,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438172444] [2025-03-17 02:53:42,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438172444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:42,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:42,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 02:53:42,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282561938] [2025-03-17 02:53:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:42,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 02:53:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:42,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 02:53:42,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:42,834 INFO L87 Difference]: Start difference. First operand 281 states and 397 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:43,116 INFO L93 Difference]: Finished difference Result 638 states and 881 transitions. [2025-03-17 02:53:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 02:53:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:43,119 INFO L225 Difference]: With dead ends: 638 [2025-03-17 02:53:43,119 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 02:53:43,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:53:43,121 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 158 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:43,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 376 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 02:53:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 332. [2025-03-17 02:53:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 276 states have (on average 1.2427536231884058) internal successors, (343), 277 states have internal predecessors, (343), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:53:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 439 transitions. [2025-03-17 02:53:43,141 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 439 transitions. Word has length 89 [2025-03-17 02:53:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:43,142 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 439 transitions. [2025-03-17 02:53:43,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,142 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 439 transitions. [2025-03-17 02:53:43,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 02:53:43,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:43,143 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:43,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 02:53:43,143 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:43,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2071546702, now seen corresponding path program 1 times [2025-03-17 02:53:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:43,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139109953] [2025-03-17 02:53:43,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:43,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 02:53:43,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 02:53:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:43,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:43,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139109953] [2025-03-17 02:53:43,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139109953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:43,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:43,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:43,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60146169] [2025-03-17 02:53:43,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:43,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:43,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:43,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:43,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:43,170 INFO L87 Difference]: Start difference. First operand 332 states and 439 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:43,226 INFO L93 Difference]: Finished difference Result 614 states and 808 transitions. [2025-03-17 02:53:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:43,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2025-03-17 02:53:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:43,229 INFO L225 Difference]: With dead ends: 614 [2025-03-17 02:53:43,229 INFO L226 Difference]: Without dead ends: 416 [2025-03-17 02:53:43,229 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-17 02:53:43,230 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:43,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 188 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-03-17 02:53:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2025-03-17 02:53:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 344 states have (on average 1.2238372093023255) internal successors, (421), 345 states have internal predecessors, (421), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 02:53:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 541 transitions. [2025-03-17 02:53:43,253 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 541 transitions. Word has length 89 [2025-03-17 02:53:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:43,253 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 541 transitions. [2025-03-17 02:53:43,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 541 transitions. [2025-03-17 02:53:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 02:53:43,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:43,254 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 02:53:43,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:43,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1373228343, now seen corresponding path program 1 times [2025-03-17 02:53:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710465746] [2025-03-17 02:53:43,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:43,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 02:53:43,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 02:53:43,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:43,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:43,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710465746] [2025-03-17 02:53:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710465746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:43,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255632600] [2025-03-17 02:53:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:43,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:43,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:43,313 INFO L87 Difference]: Start difference. First operand 414 states and 541 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:43,387 INFO L93 Difference]: Finished difference Result 691 states and 902 transitions. [2025-03-17 02:53:43,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-17 02:53:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:43,389 INFO L225 Difference]: With dead ends: 691 [2025-03-17 02:53:43,389 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 02:53:43,390 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-17 02:53:43,390 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:43,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:53:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 02:53:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 360. [2025-03-17 02:53:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 304 states have (on average 1.2138157894736843) internal successors, (369), 305 states have internal predecessors, (369), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 02:53:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 465 transitions. [2025-03-17 02:53:43,417 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 465 transitions. Word has length 90 [2025-03-17 02:53:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:43,417 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 465 transitions. [2025-03-17 02:53:43,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 465 transitions. [2025-03-17 02:53:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 02:53:43,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:43,419 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:43,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 02:53:43,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:43,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 528756472, now seen corresponding path program 1 times [2025-03-17 02:53:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708936570] [2025-03-17 02:53:43,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 02:53:43,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 02:53:43,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:43,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:43,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:43,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708936570] [2025-03-17 02:53:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708936570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125957840] [2025-03-17 02:53:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:43,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:43,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:43,717 INFO L87 Difference]: Start difference. First operand 360 states and 465 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:44,232 INFO L93 Difference]: Finished difference Result 805 states and 1030 transitions. [2025-03-17 02:53:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:53:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-17 02:53:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:44,235 INFO L225 Difference]: With dead ends: 805 [2025-03-17 02:53:44,235 INFO L226 Difference]: Without dead ends: 468 [2025-03-17 02:53:44,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:53:44,236 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 192 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:44,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 596 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 02:53:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-17 02:53:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 458. [2025-03-17 02:53:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 363 states have (on average 1.1735537190082646) internal successors, (426), 367 states have internal predecessors, (426), 78 states have call successors, (78), 16 states have call predecessors, (78), 16 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 02:53:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 582 transitions. [2025-03-17 02:53:44,286 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 582 transitions. Word has length 90 [2025-03-17 02:53:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:44,287 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 582 transitions. [2025-03-17 02:53:44,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 582 transitions. [2025-03-17 02:53:44,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 02:53:44,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:44,289 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:44,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 02:53:44,289 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1562301439, now seen corresponding path program 1 times [2025-03-17 02:53:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505213226] [2025-03-17 02:53:44,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:44,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 02:53:44,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 02:53:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:44,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505213226] [2025-03-17 02:53:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505213226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:44,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60191897] [2025-03-17 02:53:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:44,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:44,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:44,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:44,389 INFO L87 Difference]: Start difference. First operand 458 states and 582 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:44,694 INFO L93 Difference]: Finished difference Result 1071 states and 1360 transitions. [2025-03-17 02:53:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:53:44,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2025-03-17 02:53:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:44,698 INFO L225 Difference]: With dead ends: 1071 [2025-03-17 02:53:44,698 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 02:53:44,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:44,699 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 208 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:44,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 338 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 02:53:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 585. [2025-03-17 02:53:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 436 states have (on average 1.135321100917431) internal successors, (495), 442 states have internal predecessors, (495), 122 states have call successors, (122), 26 states have call predecessors, (122), 26 states have return successors, (122), 116 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-17 02:53:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 739 transitions. [2025-03-17 02:53:44,764 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 739 transitions. Word has length 90 [2025-03-17 02:53:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:44,764 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 739 transitions. [2025-03-17 02:53:44,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 739 transitions. [2025-03-17 02:53:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 02:53:44,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:44,766 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:44,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 02:53:44,766 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:44,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1558293811, now seen corresponding path program 1 times [2025-03-17 02:53:44,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:44,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553301020] [2025-03-17 02:53:44,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:44,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 02:53:44,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 02:53:44,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:44,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:44,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553301020] [2025-03-17 02:53:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553301020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:44,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:53:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911224241] [2025-03-17 02:53:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:44,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:53:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:44,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:53:44,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:53:44,813 INFO L87 Difference]: Start difference. First operand 585 states and 739 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:44,978 INFO L93 Difference]: Finished difference Result 1302 states and 1652 transitions. [2025-03-17 02:53:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-17 02:53:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:44,983 INFO L225 Difference]: With dead ends: 1302 [2025-03-17 02:53:44,983 INFO L226 Difference]: Without dead ends: 740 [2025-03-17 02:53:44,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:44,986 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 67 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:44,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 144 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-17 02:53:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 595. [2025-03-17 02:53:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 446 states have (on average 1.1367713004484306) internal successors, (507), 452 states have internal predecessors, (507), 122 states have call successors, (122), 26 states have call predecessors, (122), 26 states have return successors, (122), 116 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-17 02:53:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 751 transitions. [2025-03-17 02:53:45,044 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 751 transitions. Word has length 91 [2025-03-17 02:53:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:45,045 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 751 transitions. [2025-03-17 02:53:45,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 751 transitions. [2025-03-17 02:53:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 02:53:45,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:45,047 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:45,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 02:53:45,047 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -238657548, now seen corresponding path program 1 times [2025-03-17 02:53:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:45,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952944869] [2025-03-17 02:53:45,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:45,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 02:53:45,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 02:53:45,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:45,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:45,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952944869] [2025-03-17 02:53:45,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952944869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:45,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:53:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419030491] [2025-03-17 02:53:45,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:45,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:53:45,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:45,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:53:45,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:53:45,110 INFO L87 Difference]: Start difference. First operand 595 states and 751 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:45,344 INFO L93 Difference]: Finished difference Result 1176 states and 1477 transitions. [2025-03-17 02:53:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:45,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-17 02:53:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:45,348 INFO L225 Difference]: With dead ends: 1176 [2025-03-17 02:53:45,348 INFO L226 Difference]: Without dead ends: 822 [2025-03-17 02:53:45,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:45,350 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 162 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:45,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 156 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-17 02:53:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 586. [2025-03-17 02:53:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 450 states have (on average 1.1422222222222222) internal successors, (514), 455 states have internal predecessors, (514), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 734 transitions. [2025-03-17 02:53:45,401 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 734 transitions. Word has length 91 [2025-03-17 02:53:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:45,401 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 734 transitions. [2025-03-17 02:53:45,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 734 transitions. [2025-03-17 02:53:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 02:53:45,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:45,403 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:45,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 02:53:45,403 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:45,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1006106933, now seen corresponding path program 1 times [2025-03-17 02:53:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:45,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958406013] [2025-03-17 02:53:45,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:45,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 02:53:45,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 02:53:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:45,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958406013] [2025-03-17 02:53:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958406013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898467223] [2025-03-17 02:53:45,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:45,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:45,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:45,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:45,652 INFO L87 Difference]: Start difference. First operand 586 states and 734 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:45,877 INFO L93 Difference]: Finished difference Result 1233 states and 1544 transitions. [2025-03-17 02:53:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2025-03-17 02:53:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:45,881 INFO L225 Difference]: With dead ends: 1233 [2025-03-17 02:53:45,881 INFO L226 Difference]: Without dead ends: 648 [2025-03-17 02:53:45,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:45,883 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:45,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 236 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-17 02:53:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 602. [2025-03-17 02:53:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 466 states have (on average 1.1416309012875536) internal successors, (532), 471 states have internal predecessors, (532), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 752 transitions. [2025-03-17 02:53:45,935 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 752 transitions. Word has length 91 [2025-03-17 02:53:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:45,936 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 752 transitions. [2025-03-17 02:53:45,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 752 transitions. [2025-03-17 02:53:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 02:53:45,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:45,938 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:45,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 02:53:45,938 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash -273097321, now seen corresponding path program 1 times [2025-03-17 02:53:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069412165] [2025-03-17 02:53:45,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:45,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 02:53:45,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 02:53:45,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:45,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:46,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069412165] [2025-03-17 02:53:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069412165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:53:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296355097] [2025-03-17 02:53:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:53:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:46,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:53:46,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:46,051 INFO L87 Difference]: Start difference. First operand 602 states and 752 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:46,445 INFO L93 Difference]: Finished difference Result 1047 states and 1313 transitions. [2025-03-17 02:53:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-17 02:53:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:46,449 INFO L225 Difference]: With dead ends: 1047 [2025-03-17 02:53:46,449 INFO L226 Difference]: Without dead ends: 672 [2025-03-17 02:53:46,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:46,450 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 169 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:46,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 378 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:53:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-17 02:53:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 602. [2025-03-17 02:53:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 466 states have (on average 1.1394849785407726) internal successors, (531), 471 states have internal predecessors, (531), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 751 transitions. [2025-03-17 02:53:46,509 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 751 transitions. Word has length 92 [2025-03-17 02:53:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:46,509 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 751 transitions. [2025-03-17 02:53:46,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 751 transitions. [2025-03-17 02:53:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 02:53:46,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:46,510 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:46,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 02:53:46,510 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:46,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:46,511 INFO L85 PathProgramCache]: Analyzing trace with hash 514084630, now seen corresponding path program 1 times [2025-03-17 02:53:46,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193643994] [2025-03-17 02:53:46,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 02:53:46,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 02:53:46,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:46,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:46,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193643994] [2025-03-17 02:53:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193643994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913320509] [2025-03-17 02:53:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:46,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:46,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:46,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:46,532 INFO L87 Difference]: Start difference. First operand 602 states and 751 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:46,637 INFO L93 Difference]: Finished difference Result 1309 states and 1642 transitions. [2025-03-17 02:53:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:46,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-17 02:53:46,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:46,640 INFO L225 Difference]: With dead ends: 1309 [2025-03-17 02:53:46,640 INFO L226 Difference]: Without dead ends: 708 [2025-03-17 02:53:46,641 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-17 02:53:46,642 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 57 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:46,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 166 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-17 02:53:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 614. [2025-03-17 02:53:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 478 states have (on average 1.1401673640167365) internal successors, (545), 483 states have internal predecessors, (545), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 765 transitions. [2025-03-17 02:53:46,696 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 765 transitions. Word has length 92 [2025-03-17 02:53:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:46,697 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 765 transitions. [2025-03-17 02:53:46,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 765 transitions. [2025-03-17 02:53:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 02:53:46,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:46,698 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 02:53:46,698 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:46,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1656696799, now seen corresponding path program 1 times [2025-03-17 02:53:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097655540] [2025-03-17 02:53:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:46,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 02:53:46,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 02:53:46,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:46,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097655540] [2025-03-17 02:53:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097655540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 02:53:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442758677] [2025-03-17 02:53:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 02:53:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 02:53:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 02:53:46,722 INFO L87 Difference]: Start difference. First operand 614 states and 765 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:46,836 INFO L93 Difference]: Finished difference Result 1348 states and 1691 transitions. [2025-03-17 02:53:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 02:53:46,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2025-03-17 02:53:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:46,840 INFO L225 Difference]: With dead ends: 1348 [2025-03-17 02:53:46,840 INFO L226 Difference]: Without dead ends: 735 [2025-03-17 02:53:46,841 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-17 02:53:46,842 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:46,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-17 02:53:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 584. [2025-03-17 02:53:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 448 states have (on average 1.125) internal successors, (504), 453 states have internal predecessors, (504), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 724 transitions. [2025-03-17 02:53:46,899 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 724 transitions. Word has length 92 [2025-03-17 02:53:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:46,899 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 724 transitions. [2025-03-17 02:53:46,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 724 transitions. [2025-03-17 02:53:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 02:53:46,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:46,902 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 02:53:46,902 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1584424546, now seen corresponding path program 1 times [2025-03-17 02:53:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:46,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426790821] [2025-03-17 02:53:46,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:46,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 02:53:46,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 02:53:46,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:46,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:46,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:46,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426790821] [2025-03-17 02:53:46,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426790821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:46,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:46,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:53:46,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75383332] [2025-03-17 02:53:46,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:53:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:46,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:53:46,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:46,962 INFO L87 Difference]: Start difference. First operand 584 states and 724 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:47,119 INFO L93 Difference]: Finished difference Result 1007 states and 1254 transitions. [2025-03-17 02:53:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-17 02:53:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:47,124 INFO L225 Difference]: With dead ends: 1007 [2025-03-17 02:53:47,124 INFO L226 Difference]: Without dead ends: 647 [2025-03-17 02:53:47,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:47,125 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 127 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:47,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 391 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-17 02:53:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 577. [2025-03-17 02:53:47,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 441 states have (on average 1.124716553287982) internal successors, (496), 446 states have internal predecessors, (496), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 716 transitions. [2025-03-17 02:53:47,181 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 716 transitions. Word has length 93 [2025-03-17 02:53:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:47,181 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 716 transitions. [2025-03-17 02:53:47,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 716 transitions. [2025-03-17 02:53:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 02:53:47,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:47,182 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:47,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 02:53:47,183 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:47,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1284743339, now seen corresponding path program 1 times [2025-03-17 02:53:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022504946] [2025-03-17 02:53:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:47,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 02:53:47,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 02:53:47,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:47,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022504946] [2025-03-17 02:53:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022504946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:53:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6719811] [2025-03-17 02:53:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:47,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:53:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:47,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:53:47,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:47,234 INFO L87 Difference]: Start difference. First operand 577 states and 716 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:47,375 INFO L93 Difference]: Finished difference Result 1157 states and 1439 transitions. [2025-03-17 02:53:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:47,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-17 02:53:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:47,379 INFO L225 Difference]: With dead ends: 1157 [2025-03-17 02:53:47,380 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 02:53:47,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:47,382 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 75 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:47,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 110 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 02:53:47,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2025-03-17 02:53:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 443 states have (on average 1.1241534988713318) internal successors, (498), 448 states have internal predecessors, (498), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 718 transitions. [2025-03-17 02:53:47,439 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 718 transitions. Word has length 93 [2025-03-17 02:53:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:47,439 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 718 transitions. [2025-03-17 02:53:47,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 718 transitions. [2025-03-17 02:53:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 02:53:47,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:47,440 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:47,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 02:53:47,440 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1413826058, now seen corresponding path program 1 times [2025-03-17 02:53:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180847134] [2025-03-17 02:53:47,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:47,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 02:53:47,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 02:53:47,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:47,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:47,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180847134] [2025-03-17 02:53:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180847134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773332272] [2025-03-17 02:53:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:47,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:47,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:47,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:47,559 INFO L87 Difference]: Start difference. First operand 579 states and 718 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:47,990 INFO L93 Difference]: Finished difference Result 1143 states and 1414 transitions. [2025-03-17 02:53:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:47,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-17 02:53:47,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:47,995 INFO L225 Difference]: With dead ends: 1143 [2025-03-17 02:53:47,995 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 02:53:47,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:47,997 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 227 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:47,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 323 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:53:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 02:53:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 585. [2025-03-17 02:53:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 449 states have (on average 1.1224944320712695) internal successors, (504), 454 states have internal predecessors, (504), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 724 transitions. [2025-03-17 02:53:48,057 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 724 transitions. Word has length 93 [2025-03-17 02:53:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:48,057 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 724 transitions. [2025-03-17 02:53:48,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 724 transitions. [2025-03-17 02:53:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 02:53:48,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:48,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:48,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 02:53:48,059 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:48,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -663383285, now seen corresponding path program 1 times [2025-03-17 02:53:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413707503] [2025-03-17 02:53:48,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:48,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:48,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 02:53:48,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 02:53:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413707503] [2025-03-17 02:53:48,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413707503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:48,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:48,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863495776] [2025-03-17 02:53:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:48,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:48,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:48,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:48,167 INFO L87 Difference]: Start difference. First operand 585 states and 724 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:48,461 INFO L93 Difference]: Finished difference Result 1286 states and 1604 transitions. [2025-03-17 02:53:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2025-03-17 02:53:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:48,465 INFO L225 Difference]: With dead ends: 1286 [2025-03-17 02:53:48,465 INFO L226 Difference]: Without dead ends: 702 [2025-03-17 02:53:48,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:48,467 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 178 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:48,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 258 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:48,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-17 02:53:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 577. [2025-03-17 02:53:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 441 states have (on average 1.1179138321995465) internal successors, (493), 446 states have internal predecessors, (493), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2025-03-17 02:53:48,521 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 93 [2025-03-17 02:53:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:48,521 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2025-03-17 02:53:48,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2025-03-17 02:53:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:53:48,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:48,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:48,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 02:53:48,522 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1219282257, now seen corresponding path program 1 times [2025-03-17 02:53:48,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:48,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242449020] [2025-03-17 02:53:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:48,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:53:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:53:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:48,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242449020] [2025-03-17 02:53:48,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242449020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:48,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:48,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399401446] [2025-03-17 02:53:48,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:48,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:48,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:48,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:48,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:48,581 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:48,725 INFO L93 Difference]: Finished difference Result 1187 states and 1472 transitions. [2025-03-17 02:53:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 02:53:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-17 02:53:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:48,731 INFO L225 Difference]: With dead ends: 1187 [2025-03-17 02:53:48,732 INFO L226 Difference]: Without dead ends: 611 [2025-03-17 02:53:48,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:48,733 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 76 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:48,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 280 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-17 02:53:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 577. [2025-03-17 02:53:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 441 states have (on average 1.1133786848072562) internal successors, (491), 446 states have internal predecessors, (491), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 711 transitions. [2025-03-17 02:53:48,822 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 711 transitions. Word has length 94 [2025-03-17 02:53:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:48,822 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 711 transitions. [2025-03-17 02:53:48,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 711 transitions. [2025-03-17 02:53:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:53:48,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:48,824 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:48,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 02:53:48,824 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash 134027440, now seen corresponding path program 1 times [2025-03-17 02:53:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441383667] [2025-03-17 02:53:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:48,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:53:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:53:48,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:48,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441383667] [2025-03-17 02:53:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441383667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:53:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862346886] [2025-03-17 02:53:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:48,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:53:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:48,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:53:48,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:53:48,900 INFO L87 Difference]: Start difference. First operand 577 states and 711 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:49,077 INFO L93 Difference]: Finished difference Result 1182 states and 1461 transitions. [2025-03-17 02:53:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:49,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-17 02:53:49,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:49,080 INFO L225 Difference]: With dead ends: 1182 [2025-03-17 02:53:49,080 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 02:53:49,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:53:49,082 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 71 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:49,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 246 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 02:53:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 571. [2025-03-17 02:53:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 435 states have (on average 1.096551724137931) internal successors, (477), 440 states have internal predecessors, (477), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 697 transitions. [2025-03-17 02:53:49,136 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 697 transitions. Word has length 94 [2025-03-17 02:53:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:49,136 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 697 transitions. [2025-03-17 02:53:49,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 697 transitions. [2025-03-17 02:53:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:53:49,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:49,137 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:49,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 02:53:49,137 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash 263110159, now seen corresponding path program 1 times [2025-03-17 02:53:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453438984] [2025-03-17 02:53:49,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:49,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:53:49,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:53:49,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:49,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453438984] [2025-03-17 02:53:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453438984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:49,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090600108] [2025-03-17 02:53:49,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:49,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:49,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:49,607 INFO L87 Difference]: Start difference. First operand 571 states and 697 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:49,852 INFO L93 Difference]: Finished difference Result 1023 states and 1233 transitions. [2025-03-17 02:53:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:53:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-17 02:53:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:49,855 INFO L225 Difference]: With dead ends: 1023 [2025-03-17 02:53:49,855 INFO L226 Difference]: Without dead ends: 674 [2025-03-17 02:53:49,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:53:49,856 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 51 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:49,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 305 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:53:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-17 02:53:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 584. [2025-03-17 02:53:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 448 states have (on average 1.09375) internal successors, (490), 453 states have internal predecessors, (490), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 710 transitions. [2025-03-17 02:53:49,912 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 710 transitions. Word has length 94 [2025-03-17 02:53:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 710 transitions. [2025-03-17 02:53:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 710 transitions. [2025-03-17 02:53:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 02:53:49,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:49,914 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 02:53:49,915 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:49,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 294129966, now seen corresponding path program 1 times [2025-03-17 02:53:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136434653] [2025-03-17 02:53:49,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 02:53:49,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 02:53:49,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:49,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:50,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136434653] [2025-03-17 02:53:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136434653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:50,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:50,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311485997] [2025-03-17 02:53:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:50,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:50,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:50,150 INFO L87 Difference]: Start difference. First operand 584 states and 710 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:50,410 INFO L93 Difference]: Finished difference Result 1255 states and 1512 transitions. [2025-03-17 02:53:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 02:53:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2025-03-17 02:53:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:50,414 INFO L225 Difference]: With dead ends: 1255 [2025-03-17 02:53:50,414 INFO L226 Difference]: Without dead ends: 672 [2025-03-17 02:53:50,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:53:50,415 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 26 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:50,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 508 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:50,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-17 02:53:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 557. [2025-03-17 02:53:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 421 states have (on average 1.0902612826603326) internal successors, (459), 426 states have internal predecessors, (459), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 679 transitions. [2025-03-17 02:53:50,470 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 679 transitions. Word has length 94 [2025-03-17 02:53:50,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:50,470 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 679 transitions. [2025-03-17 02:53:50,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 679 transitions. [2025-03-17 02:53:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 02:53:50,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:50,472 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 02:53:50,472 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash -368101615, now seen corresponding path program 1 times [2025-03-17 02:53:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607133866] [2025-03-17 02:53:50,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:50,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 02:53:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 02:53:50,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:50,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607133866] [2025-03-17 02:53:50,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607133866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:50,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689352813] [2025-03-17 02:53:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:50,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:50,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:50,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:50,812 INFO L87 Difference]: Start difference. First operand 557 states and 679 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:51,252 INFO L93 Difference]: Finished difference Result 651 states and 792 transitions. [2025-03-17 02:53:51,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 02:53:51,253 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2025-03-17 02:53:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:51,256 INFO L225 Difference]: With dead ends: 651 [2025-03-17 02:53:51,256 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 02:53:51,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:53:51,257 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 174 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:51,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 379 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 02:53:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 02:53:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 569. [2025-03-17 02:53:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 433 states have (on average 1.0969976905311778) internal successors, (475), 438 states have internal predecessors, (475), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 695 transitions. [2025-03-17 02:53:51,312 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 695 transitions. Word has length 95 [2025-03-17 02:53:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:51,312 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 695 transitions. [2025-03-17 02:53:51,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:51,312 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 695 transitions. [2025-03-17 02:53:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:53:51,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:51,313 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:51,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 02:53:51,313 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:51,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash -926679317, now seen corresponding path program 1 times [2025-03-17 02:53:51,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:51,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658921505] [2025-03-17 02:53:51,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:51,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:51,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:53:51,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:53:51,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:51,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:51,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658921505] [2025-03-17 02:53:51,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658921505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:51,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:51,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767742672] [2025-03-17 02:53:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:51,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:51,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:51,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:51,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:51,421 INFO L87 Difference]: Start difference. First operand 569 states and 695 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:51,780 INFO L93 Difference]: Finished difference Result 1126 states and 1370 transitions. [2025-03-17 02:53:51,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 02:53:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2025-03-17 02:53:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:51,783 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 02:53:51,783 INFO L226 Difference]: Without dead ends: 783 [2025-03-17 02:53:51,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 02:53:51,785 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 203 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:51,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 311 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-17 02:53:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 587. [2025-03-17 02:53:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 451 states have (on average 1.0953436807095345) internal successors, (494), 456 states have internal predecessors, (494), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 714 transitions. [2025-03-17 02:53:51,841 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 714 transitions. Word has length 98 [2025-03-17 02:53:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 714 transitions. [2025-03-17 02:53:51,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 714 transitions. [2025-03-17 02:53:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 02:53:51,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:51,843 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:51,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 02:53:51,843 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash -915363190, now seen corresponding path program 1 times [2025-03-17 02:53:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:51,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91634914] [2025-03-17 02:53:51,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:51,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:51,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 02:53:51,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 02:53:51,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91634914] [2025-03-17 02:53:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91634914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 02:53:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469326411] [2025-03-17 02:53:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:51,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 02:53:51,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:51,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 02:53:51,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 02:53:51,949 INFO L87 Difference]: Start difference. First operand 587 states and 714 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:52,249 INFO L93 Difference]: Finished difference Result 1274 states and 1563 transitions. [2025-03-17 02:53:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:53:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2025-03-17 02:53:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:52,253 INFO L225 Difference]: With dead ends: 1274 [2025-03-17 02:53:52,253 INFO L226 Difference]: Without dead ends: 688 [2025-03-17 02:53:52,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:53:52,254 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 147 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:52,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 286 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:52,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-17 02:53:52,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 569. [2025-03-17 02:53:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 433 states have (on average 1.092378752886836) internal successors, (473), 438 states have internal predecessors, (473), 110 states have call successors, (110), 25 states have call predecessors, (110), 25 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 02:53:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 693 transitions. [2025-03-17 02:53:52,312 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 693 transitions. Word has length 98 [2025-03-17 02:53:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:52,312 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 693 transitions. [2025-03-17 02:53:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 693 transitions. [2025-03-17 02:53:52,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 02:53:52,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:53:52,313 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 02:53:52,313 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:53:52,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:53:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1496748146, now seen corresponding path program 1 times [2025-03-17 02:53:52,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:53:52,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531456025] [2025-03-17 02:53:52,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:53:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:53:52,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 02:53:52,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 02:53:52,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:53:52,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:53:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 02:53:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:53:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531456025] [2025-03-17 02:53:52,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531456025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:53:52,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:53:52,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 02:53:52,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743914853] [2025-03-17 02:53:52,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:53:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 02:53:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:53:52,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 02:53:52,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:53:52,629 INFO L87 Difference]: Start difference. First operand 569 states and 693 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:53:52,975 INFO L93 Difference]: Finished difference Result 598 states and 733 transitions. [2025-03-17 02:53:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 02:53:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 02:53:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:53:52,977 INFO L225 Difference]: With dead ends: 598 [2025-03-17 02:53:52,977 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 02:53:52,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-17 02:53:52,979 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 126 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:53:52,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 310 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:53:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 02:53:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 02:53:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 02:53:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 02:53:52,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2025-03-17 02:53:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:53:52,980 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 02:53:52,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 02:53:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 02:53:52,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 02:53:52,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:53:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 02:53:52,985 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:52,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 02:53:58,014 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 177 DAG size of output: 192 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)