./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.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 f3d43f98d4e2db5588660687641290344946e641f9add1ceab76c578184e0600 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:16:12,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:16:12,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:16:12,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:16:12,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:16:13,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:16:13,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:16:13,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:16:13,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:16:13,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:16:13,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:16:13,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:16:13,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:16:13,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:16:13,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:16:13,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:16:13,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:13,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:16:13,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:16:13,029 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 -> f3d43f98d4e2db5588660687641290344946e641f9add1ceab76c578184e0600 [2025-03-08 11:16:13,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:16:13,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:16:13,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:16:13,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:16:13,256 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:16:13,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i [2025-03-08 11:16:14,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe9e8e96/a8304b1f0c5847479690a91b3eff6c36/FLAGf0f4b4ba8 [2025-03-08 11:16:14,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:16:14,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i [2025-03-08 11:16:14,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe9e8e96/a8304b1f0c5847479690a91b3eff6c36/FLAGf0f4b4ba8 [2025-03-08 11:16:14,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebe9e8e96/a8304b1f0c5847479690a91b3eff6c36 [2025-03-08 11:16:14,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:16:14,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:16:14,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:14,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:16:14,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:16:14,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6bb839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:14, skipping insertion in model container [2025-03-08 11:16:14,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:16:14" (1/1) ... [2025-03-08 11:16:14,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:16:14,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i[915,928] [2025-03-08 11:16:14,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:14,981 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:16:14,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-1.i[915,928] [2025-03-08 11:16:15,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:16:15,096 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:16:15,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15 WrapperNode [2025-03-08 11:16:15,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:16:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:15,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:16:15,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:16:15,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,182 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 849 [2025-03-08 11:16:15,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:16:15,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:16:15,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:16:15,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:16:15,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:16:15,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,253 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:16:15,278 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:16:15,278 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:16:15,278 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:16:15,279 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (1/1) ... [2025-03-08 11:16:15,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:16:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:15,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:16:15,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:16:15,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:16:15,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:16:15,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:16:15,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:16:15,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:16:15,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:16:16,358 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 11:16:16,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:16:16,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:16:16,402 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:16:16,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:16 BoogieIcfgContainer [2025-03-08 11:16:16,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:16:16,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:16:16,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:16:16,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:16:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:16:14" (1/3) ... [2025-03-08 11:16:16,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1757f7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:16, skipping insertion in model container [2025-03-08 11:16:16,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:16:15" (2/3) ... [2025-03-08 11:16:16,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1757f7df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:16:16, skipping insertion in model container [2025-03-08 11:16:16,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:16:16" (3/3) ... [2025-03-08 11:16:16,411 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-1.i [2025-03-08 11:16:16,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:16:16,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-1.i that has 2 procedures, 352 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:16:16,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:16:16,487 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;@55c5651a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:16:16,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:16:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 352 states, 244 states have (on average 1.610655737704918) internal successors, (393), 245 states have internal predecessors, (393), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 11:16:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:16,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:16,516 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:16,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1131831759, now seen corresponding path program 1 times [2025-03-08 11:16:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:16,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453257669] [2025-03-08 11:16:16,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:16,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:16,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:16,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:16,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-08 11:16:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:17,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453257669] [2025-03-08 11:16:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453257669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:16:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138110353] [2025-03-08 11:16:17,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:16:17,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:16:17,037 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:16:17,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:16:17,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:17,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:17,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:17,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:16:17,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:16:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-03-08 11:16:17,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:16:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138110353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:16:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:16:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41872359] [2025-03-08 11:16:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:16:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:17,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:16:17,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:17,498 INFO L87 Difference]: Start difference. First operand has 352 states, 244 states have (on average 1.610655737704918) internal successors, (393), 245 states have internal predecessors, (393), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-08 11:16:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:17,581 INFO L93 Difference]: Finished difference Result 696 states and 1302 transitions. [2025-03-08 11:16:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:16:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 680 [2025-03-08 11:16:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:17,592 INFO L225 Difference]: With dead ends: 696 [2025-03-08 11:16:17,592 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 11:16:17,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:16:17,601 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:17,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 575 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 11:16:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-03-08 11:16:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 240 states have (on average 1.5833333333333333) internal successors, (380), 240 states have internal predecessors, (380), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-08 11:16:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 590 transitions. [2025-03-08 11:16:17,679 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 590 transitions. Word has length 680 [2025-03-08 11:16:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:17,680 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 590 transitions. [2025-03-08 11:16:17,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-03-08 11:16:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 590 transitions. [2025-03-08 11:16:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:17,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:17,695 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:17,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:16:17,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:16:17,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1847263246, now seen corresponding path program 1 times [2025-03-08 11:16:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895128539] [2025-03-08 11:16:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:17,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:18,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:18,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:18,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:18,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895128539] [2025-03-08 11:16:18,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895128539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:18,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:18,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160300325] [2025-03-08 11:16:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:18,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:18,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:18,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:18,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:18,552 INFO L87 Difference]: Start difference. First operand 347 states and 590 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:18,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:18,677 INFO L93 Difference]: Finished difference Result 913 states and 1557 transitions. [2025-03-08 11:16:18,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:18,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:18,684 INFO L225 Difference]: With dead ends: 913 [2025-03-08 11:16:18,684 INFO L226 Difference]: Without dead ends: 569 [2025-03-08 11:16:18,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:18,687 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 352 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:18,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1267 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-08 11:16:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2025-03-08 11:16:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 404 states have (on average 1.5940594059405941) internal successors, (644), 405 states have internal predecessors, (644), 159 states have call successors, (159), 2 states have call predecessors, (159), 2 states have return successors, (159), 158 states have call predecessors, (159), 159 states have call successors, (159) [2025-03-08 11:16:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 962 transitions. [2025-03-08 11:16:18,755 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 962 transitions. Word has length 680 [2025-03-08 11:16:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:18,758 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 962 transitions. [2025-03-08 11:16:18,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 962 transitions. [2025-03-08 11:16:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:18,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:18,763 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:16:18,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:18,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1199737776, now seen corresponding path program 1 times [2025-03-08 11:16:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:18,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423534057] [2025-03-08 11:16:18,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:18,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:18,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:18,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:19,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423534057] [2025-03-08 11:16:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423534057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197470158] [2025-03-08 11:16:19,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:19,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:19,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:19,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:19,187 INFO L87 Difference]: Start difference. First operand 566 states and 962 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:19,280 INFO L93 Difference]: Finished difference Result 1692 states and 2880 transitions. [2025-03-08 11:16:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:19,290 INFO L225 Difference]: With dead ends: 1692 [2025-03-08 11:16:19,291 INFO L226 Difference]: Without dead ends: 1129 [2025-03-08 11:16:19,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:19,293 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 365 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:19,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1219 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2025-03-08 11:16:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1127. [2025-03-08 11:16:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 804 states have (on average 1.5945273631840795) internal successors, (1282), 806 states have internal predecessors, (1282), 318 states have call successors, (318), 4 states have call predecessors, (318), 4 states have return successors, (318), 316 states have call predecessors, (318), 318 states have call successors, (318) [2025-03-08 11:16:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1918 transitions. [2025-03-08 11:16:19,452 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1918 transitions. Word has length 680 [2025-03-08 11:16:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:19,455 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1918 transitions. [2025-03-08 11:16:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1918 transitions. [2025-03-08 11:16:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:19,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:19,463 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:19,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:16:19,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:19,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1075664529, now seen corresponding path program 1 times [2025-03-08 11:16:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:19,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374219117] [2025-03-08 11:16:19,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:19,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:19,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:19,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:19,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:19,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374219117] [2025-03-08 11:16:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374219117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:19,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:19,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093300611] [2025-03-08 11:16:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:19,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:19,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:19,714 INFO L87 Difference]: Start difference. First operand 1127 states and 1918 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:19,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:19,842 INFO L93 Difference]: Finished difference Result 3065 states and 5232 transitions. [2025-03-08 11:16:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:19,858 INFO L225 Difference]: With dead ends: 3065 [2025-03-08 11:16:19,858 INFO L226 Difference]: Without dead ends: 1941 [2025-03-08 11:16:19,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:19,866 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 321 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:19,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1137 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2025-03-08 11:16:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1935. [2025-03-08 11:16:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1456 states have (on average 1.6236263736263736) internal successors, (2364), 1462 states have internal predecessors, (2364), 470 states have call successors, (470), 8 states have call predecessors, (470), 8 states have return successors, (470), 464 states have call predecessors, (470), 470 states have call successors, (470) [2025-03-08 11:16:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 3304 transitions. [2025-03-08 11:16:19,999 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 3304 transitions. Word has length 680 [2025-03-08 11:16:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:20,000 INFO L471 AbstractCegarLoop]: Abstraction has 1935 states and 3304 transitions. [2025-03-08 11:16:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 3304 transitions. [2025-03-08 11:16:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:20,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:20,007 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:16:20,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1493821870, now seen corresponding path program 1 times [2025-03-08 11:16:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336728473] [2025-03-08 11:16:20,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:20,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:20,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:20,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336728473] [2025-03-08 11:16:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336728473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:20,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005428568] [2025-03-08 11:16:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:20,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:20,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:20,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:20,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:20,337 INFO L87 Difference]: Start difference. First operand 1935 states and 3304 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:20,490 INFO L93 Difference]: Finished difference Result 5225 states and 8915 transitions. [2025-03-08 11:16:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:20,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:20,513 INFO L225 Difference]: With dead ends: 5225 [2025-03-08 11:16:20,513 INFO L226 Difference]: Without dead ends: 3293 [2025-03-08 11:16:20,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:20,521 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 354 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:20,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2025-03-08 11:16:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3287. [2025-03-08 11:16:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2461 states have (on average 1.617635107679805) internal successors, (3981), 2470 states have internal predecessors, (3981), 810 states have call successors, (810), 15 states have call predecessors, (810), 15 states have return successors, (810), 801 states have call predecessors, (810), 810 states have call successors, (810) [2025-03-08 11:16:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 5601 transitions. [2025-03-08 11:16:20,738 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 5601 transitions. Word has length 680 [2025-03-08 11:16:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:20,739 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 5601 transitions. [2025-03-08 11:16:20,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 5601 transitions. [2025-03-08 11:16:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:20,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:20,747 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:20,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:16:20,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:20,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash 617468499, now seen corresponding path program 1 times [2025-03-08 11:16:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:20,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301225586] [2025-03-08 11:16:20,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:20,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:20,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:20,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:20,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:20,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:20,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:20,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301225586] [2025-03-08 11:16:20,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301225586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:20,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:20,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:20,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318343194] [2025-03-08 11:16:20,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:20,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:20,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:20,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:20,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:20,987 INFO L87 Difference]: Start difference. First operand 3287 states and 5601 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:21,238 INFO L93 Difference]: Finished difference Result 9145 states and 15634 transitions. [2025-03-08 11:16:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:21,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:21,272 INFO L225 Difference]: With dead ends: 9145 [2025-03-08 11:16:21,272 INFO L226 Difference]: Without dead ends: 5949 [2025-03-08 11:16:21,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:21,285 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 326 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:21,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1126 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2025-03-08 11:16:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 5941. [2025-03-08 11:16:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5941 states, 4634 states have (on average 1.6318515321536469) internal successors, (7562), 4655 states have internal predecessors, (7562), 1278 states have call successors, (1278), 28 states have call predecessors, (1278), 28 states have return successors, (1278), 1257 states have call predecessors, (1278), 1278 states have call successors, (1278) [2025-03-08 11:16:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 10118 transitions. [2025-03-08 11:16:21,613 INFO L78 Accepts]: Start accepts. Automaton has 5941 states and 10118 transitions. Word has length 680 [2025-03-08 11:16:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:21,615 INFO L471 AbstractCegarLoop]: Abstraction has 5941 states and 10118 transitions. [2025-03-08 11:16:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 5941 states and 10118 transitions. [2025-03-08 11:16:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:21,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:21,629 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:21,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:16:21,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1471120299, now seen corresponding path program 1 times [2025-03-08 11:16:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:21,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244527034] [2025-03-08 11:16:21,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:21,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:21,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:21,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:21,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244527034] [2025-03-08 11:16:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244527034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:21,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:21,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:16:21,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457162901] [2025-03-08 11:16:21,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:21,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:16:21,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:21,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:16:21,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:16:21,893 INFO L87 Difference]: Start difference. First operand 5941 states and 10118 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:22,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:22,799 INFO L93 Difference]: Finished difference Result 22669 states and 38198 transitions. [2025-03-08 11:16:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:16:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:22,889 INFO L225 Difference]: With dead ends: 22669 [2025-03-08 11:16:22,889 INFO L226 Difference]: Without dead ends: 16823 [2025-03-08 11:16:22,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:16:22,913 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 843 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:22,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1931 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:16:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16823 states. [2025-03-08 11:16:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16823 to 16789. [2025-03-08 11:16:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16789 states, 12184 states have (on average 1.5633617859487854) internal successors, (19048), 12277 states have internal predecessors, (19048), 4498 states have call successors, (4498), 106 states have call predecessors, (4498), 106 states have return successors, (4498), 4405 states have call predecessors, (4498), 4498 states have call successors, (4498) [2025-03-08 11:16:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16789 states to 16789 states and 28044 transitions. [2025-03-08 11:16:23,869 INFO L78 Accepts]: Start accepts. Automaton has 16789 states and 28044 transitions. Word has length 680 [2025-03-08 11:16:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:23,870 INFO L471 AbstractCegarLoop]: Abstraction has 16789 states and 28044 transitions. [2025-03-08 11:16:23,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 16789 states and 28044 transitions. [2025-03-08 11:16:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:23,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:23,885 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:23,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:16:23,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:23,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1826774644, now seen corresponding path program 1 times [2025-03-08 11:16:23,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875527546] [2025-03-08 11:16:23,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:23,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:23,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:24,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:24,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875527546] [2025-03-08 11:16:24,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875527546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:24,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:24,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:24,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734091094] [2025-03-08 11:16:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:24,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:24,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:24,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:24,172 INFO L87 Difference]: Start difference. First operand 16789 states and 28044 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:25,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:25,599 INFO L93 Difference]: Finished difference Result 47529 states and 79313 transitions. [2025-03-08 11:16:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:25,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:25,752 INFO L225 Difference]: With dead ends: 47529 [2025-03-08 11:16:25,752 INFO L226 Difference]: Without dead ends: 30835 [2025-03-08 11:16:25,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:25,826 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 295 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:25,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1107 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30835 states. [2025-03-08 11:16:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30835 to 30809. [2025-03-08 11:16:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30809 states, 22267 states have (on average 1.5558000628733102) internal successors, (34643), 22456 states have internal predecessors, (34643), 8338 states have call successors, (8338), 203 states have call predecessors, (8338), 203 states have return successors, (8338), 8149 states have call predecessors, (8338), 8338 states have call successors, (8338) [2025-03-08 11:16:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30809 states to 30809 states and 51319 transitions. [2025-03-08 11:16:27,484 INFO L78 Accepts]: Start accepts. Automaton has 30809 states and 51319 transitions. Word has length 680 [2025-03-08 11:16:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 30809 states and 51319 transitions. [2025-03-08 11:16:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 30809 states and 51319 transitions. [2025-03-08 11:16:27,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:27,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:27,509 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:27,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:16:27,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 904091061, now seen corresponding path program 1 times [2025-03-08 11:16:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:27,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949442198] [2025-03-08 11:16:27,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:27,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:27,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:27,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:27,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:28,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949442198] [2025-03-08 11:16:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949442198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:28,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748104461] [2025-03-08 11:16:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:28,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:28,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:28,172 INFO L87 Difference]: Start difference. First operand 30809 states and 51319 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:29,725 INFO L93 Difference]: Finished difference Result 61519 states and 102488 transitions. [2025-03-08 11:16:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:29,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:29,874 INFO L225 Difference]: With dead ends: 61519 [2025-03-08 11:16:29,875 INFO L226 Difference]: Without dead ends: 30809 [2025-03-08 11:16:29,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:29,953 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 349 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:29,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 573 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:16:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30809 states. [2025-03-08 11:16:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30809 to 30809. [2025-03-08 11:16:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30809 states, 22267 states have (on average 1.5493330938159608) internal successors, (34499), 22456 states have internal predecessors, (34499), 8338 states have call successors, (8338), 203 states have call predecessors, (8338), 203 states have return successors, (8338), 8149 states have call predecessors, (8338), 8338 states have call successors, (8338) [2025-03-08 11:16:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30809 states to 30809 states and 51175 transitions. [2025-03-08 11:16:31,737 INFO L78 Accepts]: Start accepts. Automaton has 30809 states and 51175 transitions. Word has length 680 [2025-03-08 11:16:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:31,738 INFO L471 AbstractCegarLoop]: Abstraction has 30809 states and 51175 transitions. [2025-03-08 11:16:31,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 30809 states and 51175 transitions. [2025-03-08 11:16:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2025-03-08 11:16:31,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:31,764 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:31,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:16:31,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:31,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash 495266836, now seen corresponding path program 1 times [2025-03-08 11:16:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482647831] [2025-03-08 11:16:31,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:31,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 680 statements into 1 equivalence classes. [2025-03-08 11:16:31,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 680 of 680 statements. [2025-03-08 11:16:31,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:31,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:32,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:32,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482647831] [2025-03-08 11:16:32,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482647831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:32,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:32,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043420725] [2025-03-08 11:16:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:32,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:32,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:32,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:32,318 INFO L87 Difference]: Start difference. First operand 30809 states and 51175 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:34,303 INFO L93 Difference]: Finished difference Result 92229 states and 153225 transitions. [2025-03-08 11:16:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 680 [2025-03-08 11:16:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:34,586 INFO L225 Difference]: With dead ends: 92229 [2025-03-08 11:16:34,587 INFO L226 Difference]: Without dead ends: 61519 [2025-03-08 11:16:34,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:34,686 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 331 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:34,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1144 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61519 states. [2025-03-08 11:16:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61519 to 61517. [2025-03-08 11:16:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61517 states, 44491 states have (on average 1.5455485379065428) internal successors, (68763), 44868 states have internal predecessors, (68763), 16622 states have call successors, (16622), 403 states have call predecessors, (16622), 403 states have return successors, (16622), 16245 states have call predecessors, (16622), 16622 states have call successors, (16622) [2025-03-08 11:16:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61517 states to 61517 states and 102007 transitions. [2025-03-08 11:16:38,665 INFO L78 Accepts]: Start accepts. Automaton has 61517 states and 102007 transitions. Word has length 680 [2025-03-08 11:16:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:16:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 61517 states and 102007 transitions. [2025-03-08 11:16:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61517 states and 102007 transitions. [2025-03-08 11:16:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-08 11:16:38,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:16:38,692 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:16:38,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:16:38,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:16:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:16:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1728565040, now seen corresponding path program 1 times [2025-03-08 11:16:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:16:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020872234] [2025-03-08 11:16:38,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:16:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:16:38,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-08 11:16:38,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-08 11:16:38,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:16:38,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:16:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-03-08 11:16:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:16:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020872234] [2025-03-08 11:16:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020872234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:16:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:16:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:16:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809643819] [2025-03-08 11:16:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:16:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:16:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:16:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:16:39,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:39,113 INFO L87 Difference]: Start difference. First operand 61517 states and 102007 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-03-08 11:16:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:16:44,739 INFO L93 Difference]: Finished difference Result 184353 states and 305721 transitions. [2025-03-08 11:16:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:16:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 681 [2025-03-08 11:16:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:16:45,282 INFO L225 Difference]: With dead ends: 184353 [2025-03-08 11:16:45,283 INFO L226 Difference]: Without dead ends: 122935 [2025-03-08 11:16:45,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:16:45,467 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 400 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:16:45,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1334 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:16:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122935 states.