./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.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-8.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 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:22:45,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:22:45,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:22:45,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:22:45,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:22:45,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:22:45,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:22:45,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:22:45,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:22:45,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:22:45,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:22:45,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:22:45,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:22:45,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:22:45,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:22:45,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:22:45,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:22:45,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:22:45,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:22:45,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:22:45,217 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 -> 3a780e8c08e2ad68e979e131bc4f4540ca41356fe45ef323c559a838b7c9745a [2025-03-08 11:22:45,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:22:45,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:22:45,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:22:45,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:22:45,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:22:45,438 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-8.i [2025-03-08 11:22:46,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9fa62a5/eae8aa5054c947e5987723b122ac21e7/FLAG23c95e94c [2025-03-08 11:22:46,838 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:22:46,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-03-08 11:22:46,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9fa62a5/eae8aa5054c947e5987723b122ac21e7/FLAG23c95e94c [2025-03-08 11:22:46,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9fa62a5/eae8aa5054c947e5987723b122ac21e7 [2025-03-08 11:22:46,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:22:46,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:22:46,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:22:46,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:22:46,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:22:46,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:22:46" (1/1) ... [2025-03-08 11:22:46,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:46, skipping insertion in model container [2025-03-08 11:22:46,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:22:46" (1/1) ... [2025-03-08 11:22:46,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:22:47,016 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-8.i[915,928] [2025-03-08 11:22:47,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:22:47,214 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:22:47,223 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-8.i[915,928] [2025-03-08 11:22:47,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:22:47,320 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:22:47,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47 WrapperNode [2025-03-08 11:22:47,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:22:47,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:22:47,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:22:47,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:22:47,327 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:22:47" (1/1) ... [2025-03-08 11:22:47,347 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:22:47" (1/1) ... [2025-03-08 11:22:47,411 INFO L138 Inliner]: procedures = 26, calls = 147, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 937 [2025-03-08 11:22:47,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:22:47,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:22:47,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:22:47,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:22:47,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,460 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:22:47,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,513 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:22:47,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:22:47,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:22:47,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:22:47,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (1/1) ... [2025-03-08 11:22:47,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:22:47,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:22:47,544 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:22:47,547 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:22:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:22:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:22:47,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:22:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:22:47,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:22:47,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:22:47,676 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:22:47,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:22:48,657 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 11:22:48,657 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:22:48,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:22:48,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:22:48,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:22:48 BoogieIcfgContainer [2025-03-08 11:22:48,691 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:22:48,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:22:48,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:22:48,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:22:48,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:22:46" (1/3) ... [2025-03-08 11:22:48,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:22:48, skipping insertion in model container [2025-03-08 11:22:48,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:22:47" (2/3) ... [2025-03-08 11:22:48,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb4126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:22:48, skipping insertion in model container [2025-03-08 11:22:48,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:22:48" (3/3) ... [2025-03-08 11:22:48,700 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i [2025-03-08 11:22:48,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:22:48,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-8.i that has 2 procedures, 395 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:22:48,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:22:48,780 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;@2b66051c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:22:48,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:22:48,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 11:22:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-08 11:22:48,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:48,817 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:48,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:48,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -990423976, now seen corresponding path program 1 times [2025-03-08 11:22:48,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-03-08 11:22:48,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:48,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-08 11:22:49,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-08 11:22:49,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:49,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 266 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-03-08 11:22:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-03-08 11:22:49,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604044767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:22:49,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609500700] [2025-03-08 11:22:49,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:22:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:22:49,492 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:22:49,493 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:22:49,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes. [2025-03-08 11:22:49,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 832 of 832 statements. [2025-03-08 11:22:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:49,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1851 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:22:49,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:22:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 35378 trivial. 0 not checked. [2025-03-08 11:22:50,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:22:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609500700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:22:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:22:50,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831379648] [2025-03-08 11:22:50,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:50,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:22:50,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:50,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:22:50,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:22:50,048 INFO L87 Difference]: Start difference. First operand has 395 states, 258 states have (on average 1.5891472868217054) internal successors, (410), 259 states have internal predecessors, (410), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:22:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:50,143 INFO L93 Difference]: Finished difference Result 784 states and 1485 transitions. [2025-03-08 11:22:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:22:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) Word has length 832 [2025-03-08 11:22:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:50,154 INFO L225 Difference]: With dead ends: 784 [2025-03-08 11:22:50,154 INFO L226 Difference]: Without dead ends: 392 [2025-03-08 11:22:50,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 833 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:22:50,163 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:50,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-08 11:22:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-03-08 11:22:50,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 256 states have (on average 1.56640625) internal successors, (401), 256 states have internal predecessors, (401), 134 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 11:22:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 669 transitions. [2025-03-08 11:22:50,255 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 669 transitions. Word has length 832 [2025-03-08 11:22:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:50,257 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 669 transitions. [2025-03-08 11:22:50,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 2 states have call successors, (134), 2 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:22:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 669 transitions. [2025-03-08 11:22:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-08 11:22:50,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:50,277 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:50,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:22:50,478 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:22:50,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:50,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:50,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1561152184, now seen corresponding path program 1 times [2025-03-08 11:22:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:50,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322593731] [2025-03-08 11:22:50,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:50,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:50,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-08 11:22:50,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-08 11:22:50,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:50,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:22:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322593731] [2025-03-08 11:22:51,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322593731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:51,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:51,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:51,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604495250] [2025-03-08 11:22:51,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:51,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:51,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:51,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:51,323 INFO L87 Difference]: Start difference. First operand 392 states and 669 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:51,425 INFO L93 Difference]: Finished difference Result 1001 states and 1721 transitions. [2025-03-08 11:22:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-03-08 11:22:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:51,432 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 11:22:51,432 INFO L226 Difference]: Without dead ends: 612 [2025-03-08 11:22:51,434 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:22:51,434 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 333 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1349 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:51,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1349 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-03-08 11:22:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 609. [2025-03-08 11:22:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 443 states have (on average 1.6320541760722347) internal successors, (723), 444 states have internal predecessors, (723), 163 states have call successors, (163), 2 states have call predecessors, (163), 2 states have return successors, (163), 162 states have call predecessors, (163), 163 states have call successors, (163) [2025-03-08 11:22:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1049 transitions. [2025-03-08 11:22:51,505 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1049 transitions. Word has length 833 [2025-03-08 11:22:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:51,509 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 1049 transitions. [2025-03-08 11:22:51,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1049 transitions. [2025-03-08 11:22:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2025-03-08 11:22:51,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:51,519 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:51,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:22:51,519 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:51,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash -353234009, now seen corresponding path program 1 times [2025-03-08 11:22:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:51,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139553899] [2025-03-08 11:22:51,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:51,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 833 statements into 1 equivalence classes. [2025-03-08 11:22:51,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 833 of 833 statements. [2025-03-08 11:22:51,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:51,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:22:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:52,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139553899] [2025-03-08 11:22:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139553899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:52,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:52,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170565072] [2025-03-08 11:22:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:52,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:52,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:52,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:52,072 INFO L87 Difference]: Start difference. First operand 609 states and 1049 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:52,228 INFO L93 Difference]: Finished difference Result 1815 states and 3129 transitions. [2025-03-08 11:22:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 833 [2025-03-08 11:22:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:52,236 INFO L225 Difference]: With dead ends: 1815 [2025-03-08 11:22:52,237 INFO L226 Difference]: Without dead ends: 1209 [2025-03-08 11:22:52,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:22:52,241 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 620 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:52,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 2739 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:22:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2025-03-08 11:22:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1205. [2025-03-08 11:22:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 874 states have (on average 1.6178489702517163) internal successors, (1414), 876 states have internal predecessors, (1414), 326 states have call successors, (326), 4 states have call predecessors, (326), 4 states have return successors, (326), 324 states have call predecessors, (326), 326 states have call successors, (326) [2025-03-08 11:22:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 2066 transitions. [2025-03-08 11:22:52,368 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 2066 transitions. Word has length 833 [2025-03-08 11:22:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:52,370 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 2066 transitions. [2025-03-08 11:22:52,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 2066 transitions. [2025-03-08 11:22:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-08 11:22:52,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:52,378 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:52,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:22:52,379 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:52,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:52,380 INFO L85 PathProgramCache]: Analyzing trace with hash -482857113, now seen corresponding path program 1 times [2025-03-08 11:22:52,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:52,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743624907] [2025-03-08 11:22:52,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:52,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:52,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-08 11:22:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-08 11:22:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:22:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743624907] [2025-03-08 11:22:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743624907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 11:22:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117916493] [2025-03-08 11:22:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:52,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:22:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:52,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:22:52,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:22:52,944 INFO L87 Difference]: Start difference. First operand 1205 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:22:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:53,680 INFO L93 Difference]: Finished difference Result 4399 states and 7553 transitions. [2025-03-08 11:22:53,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:53,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) Word has length 835 [2025-03-08 11:22:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:53,701 INFO L225 Difference]: With dead ends: 4399 [2025-03-08 11:22:53,702 INFO L226 Difference]: Without dead ends: 3197 [2025-03-08 11:22:53,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:22:53,708 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 1686 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1686 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:53,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1686 Valid, 1903 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:22:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-03-08 11:22:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 3191. [2025-03-08 11:22:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2398 states have (on average 1.633861551292744) internal successors, (3918), 2406 states have internal predecessors, (3918), 780 states have call successors, (780), 12 states have call predecessors, (780), 12 states have return successors, (780), 772 states have call predecessors, (780), 780 states have call successors, (780) [2025-03-08 11:22:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 5478 transitions. [2025-03-08 11:22:53,928 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 5478 transitions. Word has length 835 [2025-03-08 11:22:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:53,929 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 5478 transitions. [2025-03-08 11:22:53,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 2 states have call predecessors, (134), 2 states have call successors, (134) [2025-03-08 11:22:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 5478 transitions. [2025-03-08 11:22:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-08 11:22:53,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:53,936 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:53,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:22:53,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 392780515, now seen corresponding path program 1 times [2025-03-08 11:22:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045813462] [2025-03-08 11:22:53,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-08 11:22:54,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-08 11:22:54,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:54,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:22:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045813462] [2025-03-08 11:22:54,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045813462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:54,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:22:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715005361] [2025-03-08 11:22:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:54,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:22:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:54,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:22:54,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:22:54,175 INFO L87 Difference]: Start difference. First operand 3191 states and 5478 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:54,349 INFO L93 Difference]: Finished difference Result 6461 states and 11108 transitions. [2025-03-08 11:22:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:22:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 835 [2025-03-08 11:22:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:54,365 INFO L225 Difference]: With dead ends: 6461 [2025-03-08 11:22:54,365 INFO L226 Difference]: Without dead ends: 3273 [2025-03-08 11:22:54,371 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:22:54,372 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 614 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:54,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1469 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:22:54,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2025-03-08 11:22:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3267. [2025-03-08 11:22:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3267 states, 2474 states have (on average 1.6329830234438156) internal successors, (4040), 2482 states have internal predecessors, (4040), 780 states have call successors, (780), 12 states have call predecessors, (780), 12 states have return successors, (780), 772 states have call predecessors, (780), 780 states have call successors, (780) [2025-03-08 11:22:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 5600 transitions. [2025-03-08 11:22:54,568 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 5600 transitions. Word has length 835 [2025-03-08 11:22:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:54,572 INFO L471 AbstractCegarLoop]: Abstraction has 3267 states and 5600 transitions. [2025-03-08 11:22:54,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 5600 transitions. [2025-03-08 11:22:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2025-03-08 11:22:54,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:54,579 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:54,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:22:54,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:54,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 361760708, now seen corresponding path program 1 times [2025-03-08 11:22:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534151742] [2025-03-08 11:22:54,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:54,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-08 11:22:54,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-08 11:22:54,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:54,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:22:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:22:55,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:22:55,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534151742] [2025-03-08 11:22:55,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534151742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:22:55,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:22:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:22:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374595824] [2025-03-08 11:22:55,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:22:55,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:22:55,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:22:55,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:22:55,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:22:55,230 INFO L87 Difference]: Start difference. First operand 3267 states and 5600 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:55,919 INFO L93 Difference]: Finished difference Result 9807 states and 16818 transitions. [2025-03-08 11:22:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:22:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 835 [2025-03-08 11:22:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:55,956 INFO L225 Difference]: With dead ends: 9807 [2025-03-08 11:22:55,956 INFO L226 Difference]: Without dead ends: 6543 [2025-03-08 11:22:55,967 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:22:55,969 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 437 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:55,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2106 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:22:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6543 states. [2025-03-08 11:22:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6543 to 6523. [2025-03-08 11:22:56,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 4938 states have (on average 1.6281895504252735) internal successors, (8040), 4954 states have internal predecessors, (8040), 1560 states have call successors, (1560), 24 states have call predecessors, (1560), 24 states have return successors, (1560), 1544 states have call predecessors, (1560), 1560 states have call successors, (1560) [2025-03-08 11:22:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 11160 transitions. [2025-03-08 11:22:56,436 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 11160 transitions. Word has length 835 [2025-03-08 11:22:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:56,437 INFO L471 AbstractCegarLoop]: Abstraction has 6523 states and 11160 transitions. [2025-03-08 11:22:56,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:22:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 11160 transitions. [2025-03-08 11:22:56,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-08 11:22:56,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:56,451 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:56,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:22:56,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:56,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 623723515, now seen corresponding path program 1 times [2025-03-08 11:22:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145737733] [2025-03-08 11:22:56,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:56,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-08 11:22:56,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-08 11:22:56,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:56,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:23:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:00,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145737733] [2025-03-08 11:23:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145737733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:23:00,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199798874] [2025-03-08 11:23:00,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:00,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:23:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:00,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:23:00,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:23:00,237 INFO L87 Difference]: Start difference. First operand 6523 states and 11160 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:23:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:02,976 INFO L93 Difference]: Finished difference Result 38067 states and 65230 transitions. [2025-03-08 11:23:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 11:23:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) Word has length 836 [2025-03-08 11:23:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:03,104 INFO L225 Difference]: With dead ends: 38067 [2025-03-08 11:23:03,105 INFO L226 Difference]: Without dead ends: 31547 [2025-03-08 11:23:03,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:23:03,135 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 2934 mSDsluCounter, 2622 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2934 SdHoareTripleChecker+Valid, 3687 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:03,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2934 Valid, 3687 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 11:23:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31547 states. [2025-03-08 11:23:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31547 to 27165. [2025-03-08 11:23:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27165 states, 21428 states have (on average 1.6484972932611537) internal successors, (35324), 21532 states have internal predecessors, (35324), 5616 states have call successors, (5616), 120 states have call predecessors, (5616), 120 states have return successors, (5616), 5512 states have call predecessors, (5616), 5616 states have call successors, (5616) [2025-03-08 11:23:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27165 states to 27165 states and 46556 transitions. [2025-03-08 11:23:04,761 INFO L78 Accepts]: Start accepts. Automaton has 27165 states and 46556 transitions. Word has length 836 [2025-03-08 11:23:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:23:04,762 INFO L471 AbstractCegarLoop]: Abstraction has 27165 states and 46556 transitions. [2025-03-08 11:23:04,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 1 states have call predecessors, (134), 1 states have call successors, (134) [2025-03-08 11:23:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27165 states and 46556 transitions. [2025-03-08 11:23:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-08 11:23:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:23:04,784 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:04,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:23:04,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:23:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:23:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1732538714, now seen corresponding path program 1 times [2025-03-08 11:23:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:23:04,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647037463] [2025-03-08 11:23:04,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:23:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:23:04,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-08 11:23:05,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-08 11:23:05,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:23:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:23:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35644 trivial. 0 not checked. [2025-03-08 11:23:11,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:23:11,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647037463] [2025-03-08 11:23:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647037463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:23:11,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:23:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 11:23:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762680271] [2025-03-08 11:23:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:23:11,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:23:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:23:11,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:23:11,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:23:11,141 INFO L87 Difference]: Start difference. First operand 27165 states and 46556 transitions. Second operand has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-03-08 11:23:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:23:48,733 INFO L93 Difference]: Finished difference Result 233851 states and 400438 transitions. [2025-03-08 11:23:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 11:23:48,734 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) Word has length 836 [2025-03-08 11:23:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:23:49,436 INFO L225 Difference]: With dead ends: 233851 [2025-03-08 11:23:49,436 INFO L226 Difference]: Without dead ends: 206689 [2025-03-08 11:23:49,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=474, Invalid=1248, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 11:23:49,539 INFO L435 NwaCegarLoop]: 3049 mSDtfsCounter, 10331 mSDsluCounter, 18694 mSDsCounter, 0 mSdLazyCounter, 20427 mSolverCounterSat, 4363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10331 SdHoareTripleChecker+Valid, 21743 SdHoareTripleChecker+Invalid, 24790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4363 IncrementalHoareTripleChecker+Valid, 20427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:23:49,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10331 Valid, 21743 Invalid, 24790 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4363 Valid, 20427 Invalid, 0 Unknown, 0 Unchecked, 21.8s Time] [2025-03-08 11:23:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206689 states. [2025-03-08 11:24:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206689 to 147553. [2025-03-08 11:24:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147553 states, 117768 states have (on average 1.6482236261123564) internal successors, (194108), 118440 states have internal predecessors, (194108), 29024 states have call successors, (29024), 760 states have call predecessors, (29024), 760 states have return successors, (29024), 28352 states have call predecessors, (29024), 29024 states have call successors, (29024) [2025-03-08 11:24:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147553 states to 147553 states and 252156 transitions. [2025-03-08 11:24:01,962 INFO L78 Accepts]: Start accepts. Automaton has 147553 states and 252156 transitions. Word has length 836 [2025-03-08 11:24:01,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:24:01,963 INFO L471 AbstractCegarLoop]: Abstraction has 147553 states and 252156 transitions. [2025-03-08 11:24:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.941176470588236) internal successors, (169), 17 states have internal predecessors, (169), 3 states have call successors, (134), 1 states have call predecessors, (134), 1 states have return successors, (134), 3 states have call predecessors, (134), 3 states have call successors, (134) [2025-03-08 11:24:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 147553 states and 252156 transitions. [2025-03-08 11:24:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-08 11:24:02,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:24:02,042 INFO L218 NwaCegarLoop]: trace histogram [134, 134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:24:02,042 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:24:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:24:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1869035877, now seen corresponding path program 1 times [2025-03-08 11:24:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:24:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109944390] [2025-03-08 11:24:02,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:24:02,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-08 11:24:02,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-08 11:24:02,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:02,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 165 proven. 234 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-03-08 11:24:04,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:24:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109944390] [2025-03-08 11:24:04,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109944390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:24:04,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905065013] [2025-03-08 11:24:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:24:04,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:24:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:24:04,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:24:04,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:24:04,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-08 11:24:04,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-08 11:24:04,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:24:04,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:24:04,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:24:04,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:24:04,909 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 5745 proven. 33 refuted. 0 times theorem prover too weak. 29866 trivial. 0 not checked. [2025-03-08 11:24:04,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:24:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 35644 backedges. 366 proven. 33 refuted. 0 times theorem prover too weak. 35245 trivial. 0 not checked. [2025-03-08 11:24:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905065013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:24:05,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:24:05,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-08 11:24:05,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334568696] [2025-03-08 11:24:05,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:24:05,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:24:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:24:05,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:24:05,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:24:05,416 INFO L87 Difference]: Start difference. First operand 147553 states and 252156 transitions. Second operand has 11 states, 10 states have (on average 29.8) internal successors, (298), 11 states have internal predecessors, (298), 4 states have call successors, (224), 2 states have call predecessors, (224), 4 states have return successors, (225), 3 states have call predecessors, (225), 4 states have call successors, (225)