./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.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 1210d8db9779caa2b34faedb9da4e6c42e2b8376c95e81a461341238221703f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:49:02,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:49:03,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:49:03,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:49:03,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:49:03,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:49:03,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:49:03,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:49:03,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:49:03,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:49:03,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:49:03,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:49:03,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:49:03,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:49:03,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:49:03,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:49:03,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:49:03,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:49:03,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:03,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:49:03,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:49:03,049 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 -> 1210d8db9779caa2b34faedb9da4e6c42e2b8376c95e81a461341238221703f5 [2025-03-03 18:49:03,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:49:03,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:49:03,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:49:03,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:49:03,277 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:49:03,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i [2025-03-03 18:49:04,393 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449657b18/5501f64f08fc4150b4750c1bffcf52c5/FLAG4c19c1e8b [2025-03-03 18:49:04,612 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:49:04,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i [2025-03-03 18:49:04,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449657b18/5501f64f08fc4150b4750c1bffcf52c5/FLAG4c19c1e8b [2025-03-03 18:49:04,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449657b18/5501f64f08fc4150b4750c1bffcf52c5 [2025-03-03 18:49:04,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:49:04,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:49:04,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:04,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:49:04,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:49:04,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:04" (1/1) ... [2025-03-03 18:49:04,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51eca627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:04, skipping insertion in model container [2025-03-03 18:49:04,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:49:04" (1/1) ... [2025-03-03 18:49:04,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:49:05,056 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_codestructure_normal_file-34.i[913,926] [2025-03-03 18:49:05,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:05,099 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:49:05,106 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_codestructure_normal_file-34.i[913,926] [2025-03-03 18:49:05,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:49:05,137 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:49:05,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05 WrapperNode [2025-03-03 18:49:05,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:49:05,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:05,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:49:05,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:49:05,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,175 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-03-03 18:49:05,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:49:05,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:49:05,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:49:05,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:49:05,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:49:05,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:49:05,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:49:05,222 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:49:05,222 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:49:05,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (1/1) ... [2025-03-03 18:49:05,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:49:05,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:05,247 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:49:05,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:49:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:49:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:49:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:49:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:49:05,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:49:05,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:49:05,320 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:49:05,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:49:05,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc property_#t~bitwise20#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-03-03 18:49:05,685 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 18:49:05,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:49:05,709 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:49:05,710 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:49:05,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:05 BoogieIcfgContainer [2025-03-03 18:49:05,710 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:49:05,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:49:05,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:49:05,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:49:05,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:49:04" (1/3) ... [2025-03-03 18:49:05,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719d5d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:05, skipping insertion in model container [2025-03-03 18:49:05,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:49:05" (2/3) ... [2025-03-03 18:49:05,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719d5d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:49:05, skipping insertion in model container [2025-03-03 18:49:05,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:49:05" (3/3) ... [2025-03-03 18:49:05,719 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-34.i [2025-03-03 18:49:05,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:49:05,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-34.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:49:05,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:49:05,790 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;@3f45d810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:49:05,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:49:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:49:05,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:05,804 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:05,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:05,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:05,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1719519187, now seen corresponding path program 1 times [2025-03-03 18:49:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301370391] [2025-03-03 18:49:05,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:05,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:49:05,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:49:05,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:05,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 18:49:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301370391] [2025-03-03 18:49:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301370391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:49:06,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066627524] [2025-03-03 18:49:06,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:49:06,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:49:06,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:49:06,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:49:06,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:49:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:49:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:06,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:49:06,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:49:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-03 18:49:06,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:49:06,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066627524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:06,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:49:06,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:49:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352795720] [2025-03-03 18:49:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:49:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:06,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:49:06,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:06,263 INFO L87 Difference]: Start difference. First operand has 89 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 18:49:06,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:06,297 INFO L93 Difference]: Finished difference Result 172 states and 300 transitions. [2025-03-03 18:49:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:49:06,298 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 169 [2025-03-03 18:49:06,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:06,303 INFO L225 Difference]: With dead ends: 172 [2025-03-03 18:49:06,303 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 18:49:06,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:49:06,307 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:06,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:49:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 18:49:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 18:49:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-03-03 18:49:06,342 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 169 [2025-03-03 18:49:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:06,342 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-03-03 18:49:06,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-03 18:49:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-03-03 18:49:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:49:06,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:06,346 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:06,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:49:06,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:49:06,547 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:06,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:06,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1173146862, now seen corresponding path program 1 times [2025-03-03 18:49:06,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:06,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548340349] [2025-03-03 18:49:06,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:06,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:49:06,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:49:06,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:06,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:06,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548340349] [2025-03-03 18:49:06,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548340349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:06,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:06,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:49:06,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529322767] [2025-03-03 18:49:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:06,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:49:06,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:06,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:49:06,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:49:06,786 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:06,842 INFO L93 Difference]: Finished difference Result 206 states and 322 transitions. [2025-03-03 18:49:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:49:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2025-03-03 18:49:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:06,845 INFO L225 Difference]: With dead ends: 206 [2025-03-03 18:49:06,845 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 18:49:06,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:49:06,846 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 53 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:06,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 252 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:49:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 18:49:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2025-03-03 18:49:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2025-03-03 18:49:06,854 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 169 [2025-03-03 18:49:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:06,855 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2025-03-03 18:49:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2025-03-03 18:49:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 18:49:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:06,857 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:49:06,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1466549869, now seen corresponding path program 1 times [2025-03-03 18:49:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:06,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601945397] [2025-03-03 18:49:06,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:06,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 18:49:06,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 18:49:06,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:06,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:08,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:08,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:08,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601945397] [2025-03-03 18:49:08,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601945397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:08,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:08,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:49:08,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621885863] [2025-03-03 18:49:08,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:08,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:49:08,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:08,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:49:08,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:49:08,073 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:08,275 INFO L93 Difference]: Finished difference Result 245 states and 380 transitions. [2025-03-03 18:49:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:49:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2025-03-03 18:49:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:08,277 INFO L225 Difference]: With dead ends: 245 [2025-03-03 18:49:08,277 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 18:49:08,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:49:08,278 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 136 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:08,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 489 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:49:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 18:49:08,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2025-03-03 18:49:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2025-03-03 18:49:08,286 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 169 [2025-03-03 18:49:08,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2025-03-03 18:49:08,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2025-03-03 18:49:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:08,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:08,288 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:08,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:49:08,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1174272297, now seen corresponding path program 1 times [2025-03-03 18:49:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068751605] [2025-03-03 18:49:08,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:08,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:08,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:08,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:08,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068751605] [2025-03-03 18:49:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068751605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:17,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:49:17,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403272312] [2025-03-03 18:49:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:17,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:49:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:17,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:49:17,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:49:17,688 INFO L87 Difference]: Start difference. First operand 108 states and 170 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:18,228 INFO L93 Difference]: Finished difference Result 352 states and 547 transitions. [2025-03-03 18:49:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:49:18,229 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:18,231 INFO L225 Difference]: With dead ends: 352 [2025-03-03 18:49:18,231 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 18:49:18,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:18,232 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 281 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:18,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 838 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:49:18,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 18:49:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 111. [2025-03-03 18:49:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 174 transitions. [2025-03-03 18:49:18,242 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 174 transitions. Word has length 170 [2025-03-03 18:49:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 174 transitions. [2025-03-03 18:49:18,242 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 174 transitions. [2025-03-03 18:49:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:18,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:18,249 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:18,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:49:18,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:18,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 668713672, now seen corresponding path program 1 times [2025-03-03 18:49:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:18,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904819575] [2025-03-03 18:49:18,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:18,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:18,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:18,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:18,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904819575] [2025-03-03 18:49:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904819575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:25,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:49:25,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234321662] [2025-03-03 18:49:25,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:25,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:49:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:49:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:49:25,911 INFO L87 Difference]: Start difference. First operand 111 states and 174 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:26,289 INFO L93 Difference]: Finished difference Result 355 states and 546 transitions. [2025-03-03 18:49:26,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:49:26,290 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:26,291 INFO L225 Difference]: With dead ends: 355 [2025-03-03 18:49:26,292 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 18:49:26,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:26,292 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 322 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:26,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 863 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:49:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 18:49:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 134. [2025-03-03 18:49:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 105 states have internal predecessors, (154), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 208 transitions. [2025-03-03 18:49:26,306 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 208 transitions. Word has length 170 [2025-03-03 18:49:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:26,306 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 208 transitions. [2025-03-03 18:49:26,307 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 208 transitions. [2025-03-03 18:49:26,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:26,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:26,313 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:49:26,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash 663738120, now seen corresponding path program 1 times [2025-03-03 18:49:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409155409] [2025-03-03 18:49:26,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:26,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:26,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:26,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:26,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:33,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:33,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409155409] [2025-03-03 18:49:33,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409155409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:33,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:33,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:49:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769357157] [2025-03-03 18:49:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:33,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:49:33,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:33,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:49:33,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:49:33,932 INFO L87 Difference]: Start difference. First operand 134 states and 208 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:34,321 INFO L93 Difference]: Finished difference Result 383 states and 590 transitions. [2025-03-03 18:49:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:49:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:34,323 INFO L225 Difference]: With dead ends: 383 [2025-03-03 18:49:34,323 INFO L226 Difference]: Without dead ends: 252 [2025-03-03 18:49:34,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:49:34,324 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 159 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:34,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 932 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:49:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-03 18:49:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 135. [2025-03-03 18:49:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 209 transitions. [2025-03-03 18:49:34,334 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 209 transitions. Word has length 170 [2025-03-03 18:49:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 209 transitions. [2025-03-03 18:49:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 209 transitions. [2025-03-03 18:49:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:34,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:34,336 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:34,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:49:34,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:34,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash 158179495, now seen corresponding path program 1 times [2025-03-03 18:49:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121825317] [2025-03-03 18:49:34,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:34,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:34,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:34,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:34,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121825317] [2025-03-03 18:49:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121825317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:41,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:49:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244404450] [2025-03-03 18:49:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:41,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:49:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:41,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:49:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:49:41,745 INFO L87 Difference]: Start difference. First operand 135 states and 209 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:42,111 INFO L93 Difference]: Finished difference Result 384 states and 589 transitions. [2025-03-03 18:49:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:49:42,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:42,113 INFO L225 Difference]: With dead ends: 384 [2025-03-03 18:49:42,113 INFO L226 Difference]: Without dead ends: 252 [2025-03-03 18:49:42,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:49:42,114 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 147 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:42,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1006 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:49:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-03 18:49:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 134. [2025-03-03 18:49:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.457142857142857) internal successors, (153), 105 states have internal predecessors, (153), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 207 transitions. [2025-03-03 18:49:42,129 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 207 transitions. Word has length 170 [2025-03-03 18:49:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:42,130 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 207 transitions. [2025-03-03 18:49:42,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 207 transitions. [2025-03-03 18:49:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:42,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:42,131 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:49:42,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1267408086, now seen corresponding path program 1 times [2025-03-03 18:49:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:42,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908222897] [2025-03-03 18:49:42,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:42,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:42,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:42,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:42,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908222897] [2025-03-03 18:49:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908222897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:44,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:44,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:49:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385903088] [2025-03-03 18:49:44,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:44,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:49:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:44,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:49:44,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:44,036 INFO L87 Difference]: Start difference. First operand 134 states and 207 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:44,741 INFO L93 Difference]: Finished difference Result 419 states and 636 transitions. [2025-03-03 18:49:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:49:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:44,744 INFO L225 Difference]: With dead ends: 419 [2025-03-03 18:49:44,745 INFO L226 Difference]: Without dead ends: 288 [2025-03-03 18:49:44,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:49:44,746 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 376 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:44,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 612 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:49:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-03 18:49:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 158. [2025-03-03 18:49:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2025-03-03 18:49:44,755 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 170 [2025-03-03 18:49:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2025-03-03 18:49:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2025-03-03 18:49:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:44,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:44,757 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:44,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:49:44,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:44,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash 475402249, now seen corresponding path program 1 times [2025-03-03 18:49:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361371176] [2025-03-03 18:49:44,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:44,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:44,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:44,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:44,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:44,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361371176] [2025-03-03 18:49:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361371176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:49:53,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283689435] [2025-03-03 18:49:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:49:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:49:53,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:53,275 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:54,083 INFO L93 Difference]: Finished difference Result 429 states and 658 transitions. [2025-03-03 18:49:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:49:54,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:54,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:54,086 INFO L225 Difference]: With dead ends: 429 [2025-03-03 18:49:54,086 INFO L226 Difference]: Without dead ends: 274 [2025-03-03 18:49:54,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:49:54,088 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 254 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:54,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 755 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 18:49:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-03 18:49:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 155. [2025-03-03 18:49:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 126 states have internal predecessors, (186), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2025-03-03 18:49:54,095 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 170 [2025-03-03 18:49:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2025-03-03 18:49:54,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2025-03-03 18:49:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:54,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:54,097 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:54,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:49:54,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1772966711, now seen corresponding path program 1 times [2025-03-03 18:49:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728347866] [2025-03-03 18:49:54,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:54,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:54,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:54,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728347866] [2025-03-03 18:49:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728347866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:55,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:49:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544374016] [2025-03-03 18:49:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:49:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:55,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:49:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:55,020 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:55,674 INFO L93 Difference]: Finished difference Result 438 states and 662 transitions. [2025-03-03 18:49:55,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:49:55,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:55,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:55,676 INFO L225 Difference]: With dead ends: 438 [2025-03-03 18:49:55,676 INFO L226 Difference]: Without dead ends: 286 [2025-03-03 18:49:55,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:49:55,677 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 303 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:55,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 705 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:49:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-03 18:49:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 167. [2025-03-03 18:49:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 138 states have internal predecessors, (206), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-03 18:49:55,683 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 170 [2025-03-03 18:49:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-03 18:49:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-03 18:49:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:55,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:55,684 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:55,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:49:55,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash -30156376, now seen corresponding path program 1 times [2025-03-03 18:49:55,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:55,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943418029] [2025-03-03 18:49:55,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:55,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:55,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:55,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:55,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:55,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:56,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:56,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943418029] [2025-03-03 18:49:56,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943418029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:56,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:56,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:49:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501683958] [2025-03-03 18:49:56,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:56,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:49:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:56,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:49:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:49:56,469 INFO L87 Difference]: Start difference. First operand 167 states and 260 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:57,038 INFO L93 Difference]: Finished difference Result 431 states and 662 transitions. [2025-03-03 18:49:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:49:57,038 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:57,040 INFO L225 Difference]: With dead ends: 431 [2025-03-03 18:49:57,040 INFO L226 Difference]: Without dead ends: 267 [2025-03-03 18:49:57,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:49:57,041 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 234 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:57,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 560 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:49:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-03 18:49:57,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 167. [2025-03-03 18:49:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 138 states have internal predecessors, (206), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 18:49:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-03 18:49:57,046 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 170 [2025-03-03 18:49:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:57,046 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-03 18:49:57,046 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, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-03 18:49:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 18:49:57,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:57,048 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:57,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:49:57,048 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:57,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash 240143723, now seen corresponding path program 1 times [2025-03-03 18:49:57,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:57,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237353031] [2025-03-03 18:49:57,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:57,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 18:49:57,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 18:49:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:57,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:57,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237353031] [2025-03-03 18:49:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237353031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:57,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:57,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:49:57,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568231929] [2025-03-03 18:49:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:57,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:49:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:57,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:49:57,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:49:57,215 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:57,357 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2025-03-03 18:49:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:49:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-03 18:49:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:57,359 INFO L225 Difference]: With dead ends: 377 [2025-03-03 18:49:57,360 INFO L226 Difference]: Without dead ends: 213 [2025-03-03 18:49:57,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:49:57,361 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:57,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:49:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-03 18:49:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-03-03 18:49:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 176 states have (on average 1.4886363636363635) internal successors, (262), 177 states have internal predecessors, (262), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:49:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2025-03-03 18:49:57,371 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 170 [2025-03-03 18:49:57,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:57,372 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2025-03-03 18:49:57,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2025-03-03 18:49:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:49:57,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:57,373 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:57,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:49:57,374 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:57,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1218455182, now seen corresponding path program 1 times [2025-03-03 18:49:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935294426] [2025-03-03 18:49:57,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:57,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:49:57,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:49:57,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:57,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:49:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:49:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:49:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935294426] [2025-03-03 18:49:59,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935294426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:49:59,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:49:59,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:49:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895654436] [2025-03-03 18:49:59,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:49:59,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:49:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:49:59,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:49:59,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:49:59,118 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:49:59,939 INFO L93 Difference]: Finished difference Result 604 states and 918 transitions. [2025-03-03 18:49:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 18:49:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 18:49:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:49:59,943 INFO L225 Difference]: With dead ends: 604 [2025-03-03 18:49:59,943 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 18:49:59,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:49:59,945 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 372 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 18:49:59,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 762 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 18:49:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 18:49:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 211. [2025-03-03 18:49:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 177 states have (on average 1.4858757062146892) internal successors, (263), 178 states have internal predecessors, (263), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:49:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 325 transitions. [2025-03-03 18:49:59,955 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 325 transitions. Word has length 171 [2025-03-03 18:49:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:49:59,955 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 325 transitions. [2025-03-03 18:49:59,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:49:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 325 transitions. [2025-03-03 18:49:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:49:59,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:49:59,958 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:49:59,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:49:59,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:49:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:49:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1724013807, now seen corresponding path program 1 times [2025-03-03 18:49:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:49:59,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990439423] [2025-03-03 18:49:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:49:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:49:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:49:59,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:49:59,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:49:59,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:50:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990439423] [2025-03-03 18:50:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990439423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:50:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 18:50:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818048250] [2025-03-03 18:50:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:08,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 18:50:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:08,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 18:50:08,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:50:08,503 INFO L87 Difference]: Start difference. First operand 211 states and 325 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:09,472 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2025-03-03 18:50:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 18:50:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 18:50:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:09,474 INFO L225 Difference]: With dead ends: 604 [2025-03-03 18:50:09,474 INFO L226 Difference]: Without dead ends: 396 [2025-03-03 18:50:09,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 18:50:09,475 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 281 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:09,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 996 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:50:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-03 18:50:09,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 194. [2025-03-03 18:50:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.46875) internal successors, (235), 161 states have internal predecessors, (235), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:50:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2025-03-03 18:50:09,485 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 171 [2025-03-03 18:50:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:09,486 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2025-03-03 18:50:09,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2025-03-03 18:50:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 18:50:09,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:09,487 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:50:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:50:09,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:09,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:09,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2091262573, now seen corresponding path program 1 times [2025-03-03 18:50:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693381824] [2025-03-03 18:50:09,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:09,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:09,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 18:50:09,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 18:50:09,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:09,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:50:09,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693381824] [2025-03-03 18:50:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693381824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:50:09,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:50:09,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524806862] [2025-03-03 18:50:09,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:09,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:50:09,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:09,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:50:09,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:50:09,577 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:09,692 INFO L93 Difference]: Finished difference Result 389 states and 595 transitions. [2025-03-03 18:50:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:50:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-03 18:50:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:09,694 INFO L225 Difference]: With dead ends: 389 [2025-03-03 18:50:09,694 INFO L226 Difference]: Without dead ends: 198 [2025-03-03 18:50:09,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:50:09,694 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 354 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:50:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-03 18:50:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-03-03 18:50:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.46875) internal successors, (235), 161 states have internal predecessors, (235), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:50:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2025-03-03 18:50:09,700 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 171 [2025-03-03 18:50:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:09,700 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2025-03-03 18:50:09,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2025-03-03 18:50:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:50:09,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:09,701 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:50:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:50:09,702 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:09,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:09,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1098405842, now seen corresponding path program 1 times [2025-03-03 18:50:09,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:09,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605627057] [2025-03-03 18:50:09,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:09,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:09,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:50:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:50:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:09,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:50:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605627057] [2025-03-03 18:50:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605627057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:50:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:50:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170252443] [2025-03-03 18:50:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:50:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:10,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:50:10,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:50:10,691 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:11,259 INFO L93 Difference]: Finished difference Result 538 states and 813 transitions. [2025-03-03 18:50:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:50:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-03 18:50:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:11,262 INFO L225 Difference]: With dead ends: 538 [2025-03-03 18:50:11,262 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 18:50:11,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:50:11,263 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 270 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:11,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 704 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:50:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 18:50:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 212. [2025-03-03 18:50:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 179 states have internal predecessors, (263), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:50:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 325 transitions. [2025-03-03 18:50:11,270 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 325 transitions. Word has length 172 [2025-03-03 18:50:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:11,270 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 325 transitions. [2025-03-03 18:50:11,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 325 transitions. [2025-03-03 18:50:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:50:11,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:11,271 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:50:11,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:50:11,271 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:11,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:11,272 INFO L85 PathProgramCache]: Analyzing trace with hash 587871665, now seen corresponding path program 1 times [2025-03-03 18:50:11,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:11,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037542566] [2025-03-03 18:50:11,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:11,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:11,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:50:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:50:11,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:11,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:50:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-03 18:50:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:50:18,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037542566] [2025-03-03 18:50:18,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037542566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:50:18,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:50:18,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 18:50:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561150945] [2025-03-03 18:50:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:50:18,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 18:50:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:50:18,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 18:50:18,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 18:50:18,744 INFO L87 Difference]: Start difference. First operand 212 states and 325 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:50:19,273 INFO L93 Difference]: Finished difference Result 556 states and 840 transitions. [2025-03-03 18:50:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:50:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-03 18:50:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:50:19,275 INFO L225 Difference]: With dead ends: 556 [2025-03-03 18:50:19,275 INFO L226 Difference]: Without dead ends: 347 [2025-03-03 18:50:19,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:50:19,275 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 222 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:50:19,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1017 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:50:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-03 18:50:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 235. [2025-03-03 18:50:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 201 states have (on average 1.4776119402985075) internal successors, (297), 202 states have internal predecessors, (297), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 18:50:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2025-03-03 18:50:19,285 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 172 [2025-03-03 18:50:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:50:19,285 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2025-03-03 18:50:19,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-03 18:50:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2025-03-03 18:50:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-03 18:50:19,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:50:19,286 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:50:19,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:50:19,287 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:50:19,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:50:19,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2001142404, now seen corresponding path program 1 times [2025-03-03 18:50:19,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:50:19,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607702453] [2025-03-03 18:50:19,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:50:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:50:19,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-03 18:50:19,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-03 18:50:19,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:50:19,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat