./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.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 193401d70c061c5831a1b71d7cc3ca07095036dca68a71cb93eacc5b67e8e202 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:47:10,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:47:11,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:47:11,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:47:11,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:47:11,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:47:11,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:47:11,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:47:11,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:47:11,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:47:11,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:47:11,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:47:11,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:47:11,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:47:11,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:47:11,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:47:11,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:47:11,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:47:11,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:47:11,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:47:11,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:47:11,033 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 -> 193401d70c061c5831a1b71d7cc3ca07095036dca68a71cb93eacc5b67e8e202 [2025-03-03 19:47:11,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:47:11,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:47:11,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:47:11,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:47:11,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:47:11,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-03 19:47:12,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256721886/3d1d2645e2d14e5aa663014a45f333f1/FLAGb5fd2cf61 [2025-03-03 19:47:12,652 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:47:12,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-03 19:47:12,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256721886/3d1d2645e2d14e5aa663014a45f333f1/FLAGb5fd2cf61 [2025-03-03 19:47:12,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256721886/3d1d2645e2d14e5aa663014a45f333f1 [2025-03-03 19:47:12,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:47:12,968 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:47:12,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:47:12,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:47:12,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:47:12,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:47:12" (1/1) ... [2025-03-03 19:47:12,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:12, skipping insertion in model container [2025-03-03 19:47:12,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:47:12" (1/1) ... [2025-03-03 19:47:12,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:47:13,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i[916,929] [2025-03-03 19:47:13,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:47:13,172 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:47:13,182 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-43.i[916,929] [2025-03-03 19:47:13,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:47:13,237 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:47:13,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13 WrapperNode [2025-03-03 19:47:13,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:47:13,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:47:13,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:47:13,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:47:13,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,297 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 568 [2025-03-03 19:47:13,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:47:13,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:47:13,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:47:13,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:47:13,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,330 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 19:47:13,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:47:13,362 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:47:13,362 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:47:13,362 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:47:13,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (1/1) ... [2025-03-03 19:47:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:47:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:47:13,391 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 19:47:13,395 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 19:47:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:47:13,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:47:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:47:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:47:13,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:47:13,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:47:13,496 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:47:13,498 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:47:14,070 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L445: havoc property_#t~bitwise59#1;havoc property_#t~short60#1; [2025-03-03 19:47:14,145 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 19:47:14,145 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:47:14,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:47:14,177 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:47:14,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:47:14 BoogieIcfgContainer [2025-03-03 19:47:14,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:47:14,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:47:14,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:47:14,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:47:14,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:47:12" (1/3) ... [2025-03-03 19:47:14,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce4a54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:47:14, skipping insertion in model container [2025-03-03 19:47:14,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:47:13" (2/3) ... [2025-03-03 19:47:14,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce4a54e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:47:14, skipping insertion in model container [2025-03-03 19:47:14,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:47:14" (3/3) ... [2025-03-03 19:47:14,186 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-43.i [2025-03-03 19:47:14,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:47:14,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-43.i that has 2 procedures, 237 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:47:14,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:47:14,260 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;@1953cc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:47:14,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:47:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 19:47:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 19:47:14,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:14,287 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:14,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1647332293, now seen corresponding path program 1 times [2025-03-03 19:47:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:14,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673735373] [2025-03-03 19:47:14,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:14,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 19:47:14,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 19:47:14,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:14,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 19:47:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673735373] [2025-03-03 19:47:14,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673735373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:47:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931804942] [2025-03-03 19:47:14,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:47:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:47:14,747 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 19:47:14,749 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 19:47:14,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 19:47:14,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 19:47:14,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:14,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:14,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:47:15,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:47:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-03 19:47:15,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:47:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931804942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:47:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:47:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968633364] [2025-03-03 19:47:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:15,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:47:15,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:15,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:47:15,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:47:15,093 INFO L87 Difference]: Start difference. First operand has 237 states, 153 states have (on average 1.5294117647058822) internal successors, (234), 154 states have internal predecessors, (234), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:47:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:15,155 INFO L93 Difference]: Finished difference Result 468 states and 868 transitions. [2025-03-03 19:47:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:47:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 507 [2025-03-03 19:47:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:15,165 INFO L225 Difference]: With dead ends: 468 [2025-03-03 19:47:15,166 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 19:47:15,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 508 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 19:47:15,174 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:15,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:47:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 19:47:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-03 19:47:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 151 states have internal predecessors, (229), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 19:47:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 391 transitions. [2025-03-03 19:47:15,234 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 391 transitions. Word has length 507 [2025-03-03 19:47:15,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:15,235 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 391 transitions. [2025-03-03 19:47:15,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:47:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 391 transitions. [2025-03-03 19:47:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 19:47:15,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:15,245 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:15,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:47:15,446 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 19:47:15,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:15,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash -328091582, now seen corresponding path program 1 times [2025-03-03 19:47:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921447798] [2025-03-03 19:47:15,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:15,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:15,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 19:47:15,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 19:47:15,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:15,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921447798] [2025-03-03 19:47:15,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921447798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:15,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:15,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:47:15,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497894512] [2025-03-03 19:47:15,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:15,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:47:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:15,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:47:15,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:15,900 INFO L87 Difference]: Start difference. First operand 234 states and 391 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:15,983 INFO L93 Difference]: Finished difference Result 606 states and 1008 transitions. [2025-03-03 19:47:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 507 [2025-03-03 19:47:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:15,987 INFO L225 Difference]: With dead ends: 606 [2025-03-03 19:47:15,988 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 19:47:15,988 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 19:47:15,989 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 226 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:15,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 738 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:47:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 19:47:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2025-03-03 19:47:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 237 states have (on average 1.4852320675105486) internal successors, (352), 238 states have internal predecessors, (352), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 19:47:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 616 transitions. [2025-03-03 19:47:16,022 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 616 transitions. Word has length 507 [2025-03-03 19:47:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 616 transitions. [2025-03-03 19:47:16,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 616 transitions. [2025-03-03 19:47:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 19:47:16,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:16,040 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:47:16,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash 80732643, now seen corresponding path program 1 times [2025-03-03 19:47:16,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735188582] [2025-03-03 19:47:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:16,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 19:47:16,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 19:47:16,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:16,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735188582] [2025-03-03 19:47:16,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735188582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:16,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:16,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:47:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207419051] [2025-03-03 19:47:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:16,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:47:16,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:16,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:47:16,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:16,379 INFO L87 Difference]: Start difference. First operand 372 states and 616 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:16,431 INFO L93 Difference]: Finished difference Result 743 states and 1233 transitions. [2025-03-03 19:47:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:16,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 507 [2025-03-03 19:47:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:16,440 INFO L225 Difference]: With dead ends: 743 [2025-03-03 19:47:16,440 INFO L226 Difference]: Without dead ends: 374 [2025-03-03 19:47:16,441 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 19:47:16,441 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 0 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:16,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 755 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:47:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-03 19:47:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-03-03 19:47:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 239 states have (on average 1.4811715481171548) internal successors, (354), 240 states have internal predecessors, (354), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 19:47:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 618 transitions. [2025-03-03 19:47:16,485 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 618 transitions. Word has length 507 [2025-03-03 19:47:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:16,488 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 618 transitions. [2025-03-03 19:47:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 618 transitions. [2025-03-03 19:47:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2025-03-03 19:47:16,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:16,496 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:47:16,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 968236324, now seen corresponding path program 1 times [2025-03-03 19:47:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596508179] [2025-03-03 19:47:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 507 statements into 1 equivalence classes. [2025-03-03 19:47:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 507 of 507 statements. [2025-03-03 19:47:16,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:16,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:16,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:16,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596508179] [2025-03-03 19:47:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596508179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:16,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:47:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008295914] [2025-03-03 19:47:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:47:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:16,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:47:16,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:16,834 INFO L87 Difference]: Start difference. First operand 374 states and 618 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:16,898 INFO L93 Difference]: Finished difference Result 745 states and 1233 transitions. [2025-03-03 19:47:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:16,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 507 [2025-03-03 19:47:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:16,901 INFO L225 Difference]: With dead ends: 745 [2025-03-03 19:47:16,901 INFO L226 Difference]: Without dead ends: 374 [2025-03-03 19:47:16,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:16,903 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 388 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:16,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 364 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:47:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-03 19:47:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-03-03 19:47:16,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 239 states have (on average 1.4769874476987448) internal successors, (353), 240 states have internal predecessors, (353), 132 states have call successors, (132), 2 states have call predecessors, (132), 2 states have return successors, (132), 131 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-03 19:47:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 617 transitions. [2025-03-03 19:47:16,945 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 617 transitions. Word has length 507 [2025-03-03 19:47:16,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:16,946 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 617 transitions. [2025-03-03 19:47:16,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 617 transitions. [2025-03-03 19:47:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-03 19:47:16,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:16,953 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:47:16,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:16,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -613079148, now seen corresponding path program 1 times [2025-03-03 19:47:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:16,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670040845] [2025-03-03 19:47:16,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:16,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:16,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-03 19:47:17,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-03 19:47:17,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670040845] [2025-03-03 19:47:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670040845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:17,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:17,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:47:17,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865283808] [2025-03-03 19:47:17,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:17,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:47:17,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:17,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:47:17,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:47:17,290 INFO L87 Difference]: Start difference. First operand 374 states and 617 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:17,666 INFO L93 Difference]: Finished difference Result 998 states and 1652 transitions. [2025-03-03 19:47:17,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:47:17,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 508 [2025-03-03 19:47:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:17,672 INFO L225 Difference]: With dead ends: 998 [2025-03-03 19:47:17,673 INFO L226 Difference]: Without dead ends: 627 [2025-03-03 19:47:17,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:47:17,675 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 628 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:17,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 635 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:47:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-03 19:47:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2025-03-03 19:47:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 426 states have (on average 1.5258215962441315) internal successors, (650), 429 states have internal predecessors, (650), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 189 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-03 19:47:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1034 transitions. [2025-03-03 19:47:17,764 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1034 transitions. Word has length 508 [2025-03-03 19:47:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:17,764 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 1034 transitions. [2025-03-03 19:47:17,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1034 transitions. [2025-03-03 19:47:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:17,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:17,771 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:47:17,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1348763763, now seen corresponding path program 1 times [2025-03-03 19:47:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170875992] [2025-03-03 19:47:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:17,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:17,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:17,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:17,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:17,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170875992] [2025-03-03 19:47:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170875992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:47:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410083994] [2025-03-03 19:47:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:18,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:47:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:18,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:47:18,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:18,170 INFO L87 Difference]: Start difference. First operand 623 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:18,298 INFO L93 Difference]: Finished difference Result 1737 states and 2887 transitions. [2025-03-03 19:47:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:18,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 509 [2025-03-03 19:47:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:18,311 INFO L225 Difference]: With dead ends: 1737 [2025-03-03 19:47:18,311 INFO L226 Difference]: Without dead ends: 1117 [2025-03-03 19:47:18,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:18,313 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 236 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:18,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 731 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:47:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-03-03 19:47:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1113. [2025-03-03 19:47:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 786 states have (on average 1.5458015267175573) internal successors, (1215), 793 states have internal predecessors, (1215), 318 states have call successors, (318), 8 states have call predecessors, (318), 8 states have return successors, (318), 311 states have call predecessors, (318), 318 states have call successors, (318) [2025-03-03 19:47:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1851 transitions. [2025-03-03 19:47:18,412 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1851 transitions. Word has length 509 [2025-03-03 19:47:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:18,413 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1851 transitions. [2025-03-03 19:47:18,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1851 transitions. [2025-03-03 19:47:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:18,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:18,420 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:47:18,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1797460402, now seen corresponding path program 1 times [2025-03-03 19:47:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361646039] [2025-03-03 19:47:18,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:18,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:18,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:18,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:20,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361646039] [2025-03-03 19:47:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361646039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:47:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931061571] [2025-03-03 19:47:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:47:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:20,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:47:20,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:47:20,314 INFO L87 Difference]: Start difference. First operand 1113 states and 1851 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-03 19:47:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:23,833 INFO L93 Difference]: Finished difference Result 7533 states and 12362 transitions. [2025-03-03 19:47:23,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:47:23,834 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) Word has length 509 [2025-03-03 19:47:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:23,865 INFO L225 Difference]: With dead ends: 7533 [2025-03-03 19:47:23,866 INFO L226 Difference]: Without dead ends: 6423 [2025-03-03 19:47:23,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:47:23,871 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 2773 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 1338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2773 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1338 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:23,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2773 Valid, 1671 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1338 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 19:47:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2025-03-03 19:47:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 3084. [2025-03-03 19:47:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2168 states have (on average 1.529981549815498) internal successors, (3317), 2191 states have internal predecessors, (3317), 888 states have call successors, (888), 27 states have call predecessors, (888), 27 states have return successors, (888), 865 states have call predecessors, (888), 888 states have call successors, (888) [2025-03-03 19:47:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 5093 transitions. [2025-03-03 19:47:24,179 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 5093 transitions. Word has length 509 [2025-03-03 19:47:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:24,180 INFO L471 AbstractCegarLoop]: Abstraction has 3084 states and 5093 transitions. [2025-03-03 19:47:24,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 3 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 3 states have call predecessors, (81), 3 states have call successors, (81) [2025-03-03 19:47:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 5093 transitions. [2025-03-03 19:47:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:24,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:24,185 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:47:24,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1766440595, now seen corresponding path program 1 times [2025-03-03 19:47:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836696032] [2025-03-03 19:47:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:24,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:24,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:24,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:24,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836696032] [2025-03-03 19:47:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836696032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:25,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:47:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629650985] [2025-03-03 19:47:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:25,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:47:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:25,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:47:25,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:47:25,804 INFO L87 Difference]: Start difference. First operand 3084 states and 5093 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:47:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:29,065 INFO L93 Difference]: Finished difference Result 10433 states and 17247 transitions. [2025-03-03 19:47:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:47:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) Word has length 509 [2025-03-03 19:47:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:29,095 INFO L225 Difference]: With dead ends: 10433 [2025-03-03 19:47:29,095 INFO L226 Difference]: Without dead ends: 7352 [2025-03-03 19:47:29,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2025-03-03 19:47:29,104 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1466 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:29,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 2851 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 19:47:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2025-03-03 19:47:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 4831. [2025-03-03 19:47:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4831 states, 3544 states have (on average 1.5705417607223475) internal successors, (5566), 3575 states have internal predecessors, (5566), 1247 states have call successors, (1247), 39 states have call predecessors, (1247), 39 states have return successors, (1247), 1216 states have call predecessors, (1247), 1247 states have call successors, (1247) [2025-03-03 19:47:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4831 states to 4831 states and 8060 transitions. [2025-03-03 19:47:29,582 INFO L78 Accepts]: Start accepts. Automaton has 4831 states and 8060 transitions. Word has length 509 [2025-03-03 19:47:29,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:29,583 INFO L471 AbstractCegarLoop]: Abstraction has 4831 states and 8060 transitions. [2025-03-03 19:47:29,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:47:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 4831 states and 8060 transitions. [2025-03-03 19:47:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:29,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:29,589 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:29,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:47:29,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:29,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash -771968403, now seen corresponding path program 1 times [2025-03-03 19:47:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587263112] [2025-03-03 19:47:29,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:29,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:29,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:29,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587263112] [2025-03-03 19:47:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587263112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:47:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524516956] [2025-03-03 19:47:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:29,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:47:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:29,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:47:29,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:47:29,878 INFO L87 Difference]: Start difference. First operand 4831 states and 8060 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:47:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:30,879 INFO L93 Difference]: Finished difference Result 12984 states and 21694 transitions. [2025-03-03 19:47:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 509 [2025-03-03 19:47:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:30,909 INFO L225 Difference]: With dead ends: 12984 [2025-03-03 19:47:30,909 INFO L226 Difference]: Without dead ends: 8231 [2025-03-03 19:47:30,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:47:30,924 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 372 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:30,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1174 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:47:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8231 states. [2025-03-03 19:47:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8231 to 8229. [2025-03-03 19:47:31,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 6012 states have (on average 1.567531603459747) internal successors, (9424), 6065 states have internal predecessors, (9424), 2151 states have call successors, (2151), 65 states have call predecessors, (2151), 65 states have return successors, (2151), 2098 states have call predecessors, (2151), 2151 states have call successors, (2151) [2025-03-03 19:47:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 13726 transitions. [2025-03-03 19:47:31,782 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 13726 transitions. Word has length 509 [2025-03-03 19:47:31,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:31,829 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 13726 transitions. [2025-03-03 19:47:31,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:47:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 13726 transitions. [2025-03-03 19:47:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:31,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:31,842 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:31,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:47:31,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:31,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash -164656403, now seen corresponding path program 1 times [2025-03-03 19:47:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627102268] [2025-03-03 19:47:31,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:31,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:31,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:31,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:31,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:31,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627102268] [2025-03-03 19:47:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627102268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:31,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:31,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:47:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640001073] [2025-03-03 19:47:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:31,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:47:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:31,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:47:31,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:47:31,947 INFO L87 Difference]: Start difference. First operand 8229 states and 13726 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:33,592 INFO L93 Difference]: Finished difference Result 23842 states and 39688 transitions. [2025-03-03 19:47:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:47:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 509 [2025-03-03 19:47:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:33,648 INFO L225 Difference]: With dead ends: 23842 [2025-03-03 19:47:33,648 INFO L226 Difference]: Without dead ends: 15691 [2025-03-03 19:47:33,669 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 19:47:33,669 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 285 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:33,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 787 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:47:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15691 states. [2025-03-03 19:47:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15691 to 15684. [2025-03-03 19:47:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15684 states, 11379 states have (on average 1.5501362158361895) internal successors, (17639), 11488 states have internal predecessors, (17639), 4177 states have call successors, (4177), 127 states have call predecessors, (4177), 127 states have return successors, (4177), 4068 states have call predecessors, (4177), 4177 states have call successors, (4177) [2025-03-03 19:47:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15684 states to 15684 states and 25993 transitions. [2025-03-03 19:47:35,185 INFO L78 Accepts]: Start accepts. Automaton has 15684 states and 25993 transitions. Word has length 509 [2025-03-03 19:47:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:35,186 INFO L471 AbstractCegarLoop]: Abstraction has 15684 states and 25993 transitions. [2025-03-03 19:47:35,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-03 19:47:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15684 states and 25993 transitions. [2025-03-03 19:47:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:35,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:35,197 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:35,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:47:35,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1087339986, now seen corresponding path program 1 times [2025-03-03 19:47:35,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:35,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263366251] [2025-03-03 19:47:35,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:35,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:35,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:35,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263366251] [2025-03-03 19:47:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263366251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:47:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246798395] [2025-03-03 19:47:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:36,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:47:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:47:36,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:47:36,694 INFO L87 Difference]: Start difference. First operand 15684 states and 25993 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:47:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:47:44,367 INFO L93 Difference]: Finished difference Result 52435 states and 86239 transitions. [2025-03-03 19:47:44,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:47:44,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) Word has length 509 [2025-03-03 19:47:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:47:44,538 INFO L225 Difference]: With dead ends: 52435 [2025-03-03 19:47:44,538 INFO L226 Difference]: Without dead ends: 43343 [2025-03-03 19:47:44,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:47:44,578 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1857 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 3120 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:47:44,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 3120 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 19:47:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43343 states. [2025-03-03 19:47:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43343 to 27098. [2025-03-03 19:47:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27098 states, 19347 states have (on average 1.539205044709774) internal successors, (29779), 19540 states have internal predecessors, (29779), 7501 states have call successors, (7501), 249 states have call predecessors, (7501), 249 states have return successors, (7501), 7308 states have call predecessors, (7501), 7501 states have call successors, (7501) [2025-03-03 19:47:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27098 states to 27098 states and 44781 transitions. [2025-03-03 19:47:48,167 INFO L78 Accepts]: Start accepts. Automaton has 27098 states and 44781 transitions. Word has length 509 [2025-03-03 19:47:48,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:47:48,168 INFO L471 AbstractCegarLoop]: Abstraction has 27098 states and 44781 transitions. [2025-03-03 19:47:48,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:47:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27098 states and 44781 transitions. [2025-03-03 19:47:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:47:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:47:48,186 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:48,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:47:48,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:47:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:47:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1197523469, now seen corresponding path program 1 times [2025-03-03 19:47:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:47:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910892454] [2025-03-03 19:47:48,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:47:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:47:48,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:47:48,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:47:48,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:47:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:47:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:47:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:47:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910892454] [2025-03-03 19:47:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910892454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:47:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:47:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:47:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285508114] [2025-03-03 19:47:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:47:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:47:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:47:49,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:47:49,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:47:49,123 INFO L87 Difference]: Start difference. First operand 27098 states and 44781 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:48:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:48:00,974 INFO L93 Difference]: Finished difference Result 72308 states and 118722 transitions. [2025-03-03 19:48:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 19:48:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) Word has length 509 [2025-03-03 19:48:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:48:01,154 INFO L225 Difference]: With dead ends: 72308 [2025-03-03 19:48:01,154 INFO L226 Difference]: Without dead ends: 56411 [2025-03-03 19:48:01,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:48:01,212 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 2586 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 1459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2586 SdHoareTripleChecker+Valid, 3834 SdHoareTripleChecker+Invalid, 4401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1459 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:48:01,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2586 Valid, 3834 Invalid, 4401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1459 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 19:48:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56411 states. [2025-03-03 19:48:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56411 to 28872. [2025-03-03 19:48:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28872 states, 20743 states have (on average 1.5464976136527986) internal successors, (32079), 20944 states have internal predecessors, (32079), 7857 states have call successors, (7857), 271 states have call predecessors, (7857), 271 states have return successors, (7857), 7656 states have call predecessors, (7857), 7857 states have call successors, (7857) [2025-03-03 19:48:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28872 states to 28872 states and 47793 transitions. [2025-03-03 19:48:05,616 INFO L78 Accepts]: Start accepts. Automaton has 28872 states and 47793 transitions. Word has length 509 [2025-03-03 19:48:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:48:05,617 INFO L471 AbstractCegarLoop]: Abstraction has 28872 states and 47793 transitions. [2025-03-03 19:48:05,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 2 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 2 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-03 19:48:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28872 states and 47793 transitions. [2025-03-03 19:48:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:48:05,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:48:05,633 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:48:05,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:48:05,634 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:48:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:48:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1481800941, now seen corresponding path program 1 times [2025-03-03 19:48:05,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:48:05,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933362656] [2025-03-03 19:48:05,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:48:05,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:48:05,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:48:05,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:05,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:48:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-03 19:48:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:48:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933362656] [2025-03-03 19:48:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933362656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:48:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:48:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 19:48:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92104712] [2025-03-03 19:48:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:48:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 19:48:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:48:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 19:48:06,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:48:06,536 INFO L87 Difference]: Start difference. First operand 28872 states and 47793 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:48:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:48:14,933 INFO L93 Difference]: Finished difference Result 60995 states and 100526 transitions. [2025-03-03 19:48:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:48:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) Word has length 509 [2025-03-03 19:48:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:48:15,069 INFO L225 Difference]: With dead ends: 60995 [2025-03-03 19:48:15,069 INFO L226 Difference]: Without dead ends: 43105 [2025-03-03 19:48:15,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:48:15,120 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1420 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 2643 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:48:15,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 2643 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:48:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43105 states. [2025-03-03 19:48:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43105 to 29476. [2025-03-03 19:48:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29476 states, 21347 states have (on average 1.5525835011945472) internal successors, (33143), 21548 states have internal predecessors, (33143), 7857 states have call successors, (7857), 271 states have call predecessors, (7857), 271 states have return successors, (7857), 7656 states have call predecessors, (7857), 7857 states have call successors, (7857) [2025-03-03 19:48:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29476 states to 29476 states and 48857 transitions. [2025-03-03 19:48:19,042 INFO L78 Accepts]: Start accepts. Automaton has 29476 states and 48857 transitions. Word has length 509 [2025-03-03 19:48:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:48:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 29476 states and 48857 transitions. [2025-03-03 19:48:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 4 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 4 states have call predecessors, (81), 4 states have call successors, (81) [2025-03-03 19:48:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 29476 states and 48857 transitions. [2025-03-03 19:48:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-03-03 19:48:19,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:48:19,059 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:48:19,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:48:19,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:48:19,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:48:19,060 INFO L85 PathProgramCache]: Analyzing trace with hash 561846607, now seen corresponding path program 1 times [2025-03-03 19:48:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:48:19,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632947837] [2025-03-03 19:48:19,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:48:19,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:48:19,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:48:19,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:19,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:48:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 96 proven. 144 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:48:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:48:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632947837] [2025-03-03 19:48:19,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632947837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:48:19,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454089608] [2025-03-03 19:48:19,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:19,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:48:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:48:19,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:48:19,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:48:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-03-03 19:48:19,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-03-03 19:48:19,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:19,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:48:19,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:48:19,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:48:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 8349 proven. 69 refuted. 0 times theorem prover too weak. 4542 trivial. 0 not checked. [2025-03-03 19:48:20,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:48:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 171 proven. 69 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:48:21,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454089608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:48:21,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:48:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-03 19:48:21,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086664018] [2025-03-03 19:48:21,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:48:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:48:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:48:21,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:48:21,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:48:21,611 INFO L87 Difference]: Start difference. First operand 29476 states and 48857 transitions. Second operand has 17 states, 17 states have (on average 11.882352941176471) internal successors, (202), 17 states have internal predecessors, (202), 8 states have call successors, (169), 4 states have call predecessors, (169), 7 states have return successors, (170), 8 states have call predecessors, (170), 8 states have call successors, (170) [2025-03-03 19:48:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:48:25,629 INFO L93 Difference]: Finished difference Result 46534 states and 76219 transitions. [2025-03-03 19:48:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 19:48:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.882352941176471) internal successors, (202), 17 states have internal predecessors, (202), 8 states have call successors, (169), 4 states have call predecessors, (169), 7 states have return successors, (170), 8 states have call predecessors, (170), 8 states have call successors, (170) Word has length 509 [2025-03-03 19:48:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:48:25,705 INFO L225 Difference]: With dead ends: 46534 [2025-03-03 19:48:25,705 INFO L226 Difference]: Without dead ends: 17188 [2025-03-03 19:48:25,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2025-03-03 19:48:25,760 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 599 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:48:25,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1060 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:48:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17188 states. [2025-03-03 19:48:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17188 to 16258. [2025-03-03 19:48:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16258 states, 11433 states have (on average 1.5137759118341643) internal successors, (17307), 11530 states have internal predecessors, (17307), 4581 states have call successors, (4581), 243 states have call predecessors, (4581), 243 states have return successors, (4581), 4484 states have call predecessors, (4581), 4581 states have call successors, (4581) [2025-03-03 19:48:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 26469 transitions. [2025-03-03 19:48:28,154 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 26469 transitions. Word has length 509 [2025-03-03 19:48:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:48:28,155 INFO L471 AbstractCegarLoop]: Abstraction has 16258 states and 26469 transitions. [2025-03-03 19:48:28,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.882352941176471) internal successors, (202), 17 states have internal predecessors, (202), 8 states have call successors, (169), 4 states have call predecessors, (169), 7 states have return successors, (170), 8 states have call predecessors, (170), 8 states have call successors, (170) [2025-03-03 19:48:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 26469 transitions. [2025-03-03 19:48:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 19:48:28,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:48:28,163 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:48:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:48:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 19:48:28,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:48:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:48:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1781078016, now seen corresponding path program 1 times [2025-03-03 19:48:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:48:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592523181] [2025-03-03 19:48:28,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:48:28,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 19:48:28,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 19:48:28,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:28,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:48:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:48:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:48:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592523181] [2025-03-03 19:48:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592523181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:48:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291145457] [2025-03-03 19:48:28,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:28,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:48:28,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:48:28,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:48:28,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:48:28,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 19:48:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 19:48:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:48:28,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:48:28,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:48:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4490 proven. 51 refuted. 0 times theorem prover too weak. 8419 trivial. 0 not checked. [2025-03-03 19:48:29,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:48:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-03 19:48:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291145457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:48:29,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:48:29,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:48:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133231463] [2025-03-03 19:48:29,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:48:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:48:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:48:29,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:48:29,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:48:29,276 INFO L87 Difference]: Start difference. First operand 16258 states and 26469 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 19:48:30,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:48:30,757 INFO L93 Difference]: Finished difference Result 16458 states and 26663 transitions. [2025-03-03 19:48:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:48:30,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) Word has length 510 [2025-03-03 19:48:30,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:48:30,793 INFO L225 Difference]: With dead ends: 16458 [2025-03-03 19:48:30,793 INFO L226 Difference]: Without dead ends: 7312 [2025-03-03 19:48:30,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 1018 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:48:30,809 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 248 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:48:30,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 706 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:48:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2025-03-03 19:48:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 6488. [2025-03-03 19:48:31,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 4509 states have (on average 1.4910179640718564) internal successors, (6723), 4546 states have internal predecessors, (6723), 1865 states have call successors, (1865), 113 states have call predecessors, (1865), 113 states have return successors, (1865), 1828 states have call predecessors, (1865), 1865 states have call successors, (1865) [2025-03-03 19:48:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 10453 transitions. [2025-03-03 19:48:31,943 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 10453 transitions. Word has length 510 [2025-03-03 19:48:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:48:31,943 INFO L471 AbstractCegarLoop]: Abstraction has 6488 states and 10453 transitions. [2025-03-03 19:48:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (98), 2 states have call predecessors, (98), 4 states have return successors, (99), 2 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 19:48:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 10453 transitions. [2025-03-03 19:48:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2025-03-03 19:48:31,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:48:31,948 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:48:31,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:48:32,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:48:32,152 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:48:32,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:48:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash -819463999, now seen corresponding path program 1 times [2025-03-03 19:48:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:48:32,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585359292] [2025-03-03 19:48:32,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:48:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:48:32,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 510 statements into 1 equivalence classes. [2025-03-03 19:48:32,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 510 of 510 statements. [2025-03-03 19:48:32,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:48:32,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat