./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 975c15972d2e28638994433ae48be96fd627b5ee7b57bfcfea19e46a5c8b87bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:08:44,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:08:44,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:08:44,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:08:44,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:08:44,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:08:44,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:08:44,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:08:44,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:08:44,648 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:08:44,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:08:44,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:08:44,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:08:44,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:08:44,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:08:44,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:08:44,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:08:44,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:08:44,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:08:44,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:08:44,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:08:44,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:44,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:44,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:44,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:08:44,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:08:44,653 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-jdk21/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 -> 975c15972d2e28638994433ae48be96fd627b5ee7b57bfcfea19e46a5c8b87bf [2025-01-09 10:08:44,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:08:44,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:08:44,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:08:44,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:08:44,906 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:08:44,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i [2025-01-09 10:08:46,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3915e1427/5533a779b6b0435ca9cc2a7db8178ac3/FLAG527211d7f [2025-01-09 10:08:46,367 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:08:46,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i [2025-01-09 10:08:46,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3915e1427/5533a779b6b0435ca9cc2a7db8178ac3/FLAG527211d7f [2025-01-09 10:08:46,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3915e1427/5533a779b6b0435ca9cc2a7db8178ac3 [2025-01-09 10:08:46,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:08:46,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:08:46,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:46,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:08:46,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:08:46,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef428a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46, skipping insertion in model container [2025-01-09 10:08:46,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:08:46,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i[916,929] [2025-01-09 10:08:46,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:46,654 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:08:46,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-83.i[916,929] [2025-01-09 10:08:46,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:46,736 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:08:46,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46 WrapperNode [2025-01-09 10:08:46,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:46,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:46,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:08:46,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:08:46,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,842 INFO L138 Inliner]: procedures = 26, calls = 118, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 946 [2025-01-09 10:08:46,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:46,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:08:46,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:08:46,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:08:46,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,901 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-01-09 10:08:46,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:08:46,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:08:46,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:08:46,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:08:46,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:47,005 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:08:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:08:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:08:47,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:08:47,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:08:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:08:47,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:08:47,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:08:47,191 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:08:47,192 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:08:48,273 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 10:08:48,273 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:08:48,289 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:08:48,292 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:08:48,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:48 BoogieIcfgContainer [2025-01-09 10:08:48,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:08:48,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:08:48,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:08:48,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:08:48,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:08:46" (1/3) ... [2025-01-09 10:08:48,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbcd1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:48, skipping insertion in model container [2025-01-09 10:08:48,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (2/3) ... [2025-01-09 10:08:48,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cbcd1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:48, skipping insertion in model container [2025-01-09 10:08:48,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:48" (3/3) ... [2025-01-09 10:08:48,300 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-83.i [2025-01-09 10:08:48,310 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:08:48,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-83.i that has 2 procedures, 382 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:08:48,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:08:48,359 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;@6da0858f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:08:48,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:08:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 274 states have (on average 1.602189781021898) internal successors, (439), 275 states have internal predecessors, (439), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 10:08:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:48,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:48,385 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:48,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:48,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -861412422, now seen corresponding path program 1 times [2025-01-09 10:08:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:48,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530372490] [2025-01-09 10:08:48,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:48,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:48,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:48,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:48,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-01-09 10:08:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:48,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530372490] [2025-01-09 10:08:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530372490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584913283] [2025-01-09 10:08:48,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:48,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:08:48,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:08:49,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:49,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:49,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:49,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:49,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:08:49,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 21632 trivial. 0 not checked. [2025-01-09 10:08:49,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:08:49,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584913283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:49,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:08:49,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:08:49,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245889674] [2025-01-09 10:08:49,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:49,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:08:49,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:49,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:08:49,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:49,457 INFO L87 Difference]: Start difference. First operand has 382 states, 274 states have (on average 1.602189781021898) internal successors, (439), 275 states have internal predecessors, (439), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-01-09 10:08:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:49,516 INFO L93 Difference]: Finished difference Result 758 states and 1398 transitions. [2025-01-09 10:08:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:08:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) Word has length 685 [2025-01-09 10:08:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:49,527 INFO L225 Difference]: With dead ends: 758 [2025-01-09 10:08:49,528 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 10:08:49,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 686 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-01-09 10:08:49,536 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:49,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 10:08:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-01-09 10:08:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 272 states have (on average 1.5955882352941178) internal successors, (434), 272 states have internal predecessors, (434), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 10:08:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 644 transitions. [2025-01-09 10:08:49,611 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 644 transitions. Word has length 685 [2025-01-09 10:08:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 644 transitions. [2025-01-09 10:08:49,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (105), 2 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 2 states have call successors, (105) [2025-01-09 10:08:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 644 transitions. [2025-01-09 10:08:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:49,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:49,624 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:49,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:08:49,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:08:49,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:49,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:49,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1021915888, now seen corresponding path program 1 times [2025-01-09 10:08:49,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:49,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153072002] [2025-01-09 10:08:49,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:49,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:50,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:50,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:50,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:50,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153072002] [2025-01-09 10:08:50,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153072002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:50,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726248641] [2025-01-09 10:08:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:50,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:50,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:50,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:50,525 INFO L87 Difference]: Start difference. First operand 379 states and 644 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:50,600 INFO L93 Difference]: Finished difference Result 1001 states and 1708 transitions. [2025-01-09 10:08:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:50,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:50,605 INFO L225 Difference]: With dead ends: 1001 [2025-01-09 10:08:50,605 INFO L226 Difference]: Without dead ends: 625 [2025-01-09 10:08:50,607 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-01-09 10:08:50,607 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 403 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:50,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1276 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-01-09 10:08:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 622. [2025-01-09 10:08:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 470 states have (on average 1.6297872340425532) internal successors, (766), 471 states have internal predecessors, (766), 149 states have call successors, (149), 2 states have call predecessors, (149), 2 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-01-09 10:08:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1064 transitions. [2025-01-09 10:08:50,657 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1064 transitions. Word has length 685 [2025-01-09 10:08:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:50,658 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1064 transitions. [2025-01-09 10:08:50,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1064 transitions. [2025-01-09 10:08:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:50,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:50,668 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:08:50,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:50,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1586871570, now seen corresponding path program 1 times [2025-01-09 10:08:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003110037] [2025-01-09 10:08:50,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:50,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:50,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:50,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:50,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003110037] [2025-01-09 10:08:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003110037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:50,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839042198] [2025-01-09 10:08:50,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:50,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:50,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:50,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:50,961 INFO L87 Difference]: Start difference. First operand 622 states and 1064 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:51,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:51,028 INFO L93 Difference]: Finished difference Result 1633 states and 2792 transitions. [2025-01-09 10:08:51,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:51,039 INFO L225 Difference]: With dead ends: 1633 [2025-01-09 10:08:51,039 INFO L226 Difference]: Without dead ends: 1014 [2025-01-09 10:08:51,041 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-01-09 10:08:51,041 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 321 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:51,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1261 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-01-09 10:08:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1011. [2025-01-09 10:08:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 767 states have (on average 1.6179921773142112) internal successors, (1241), 770 states have internal predecessors, (1241), 239 states have call successors, (239), 4 states have call predecessors, (239), 4 states have return successors, (239), 236 states have call predecessors, (239), 239 states have call successors, (239) [2025-01-09 10:08:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1719 transitions. [2025-01-09 10:08:51,124 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1719 transitions. Word has length 685 [2025-01-09 10:08:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1719 transitions. [2025-01-09 10:08:51,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1719 transitions. [2025-01-09 10:08:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:51,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:51,135 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:51,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:08:51,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:51,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash -258699568, now seen corresponding path program 1 times [2025-01-09 10:08:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:51,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594396614] [2025-01-09 10:08:51,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:51,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:51,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:51,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:51,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594396614] [2025-01-09 10:08:51,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594396614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:51,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:51,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:51,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180689637] [2025-01-09 10:08:51,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:51,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:51,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:51,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:51,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,402 INFO L87 Difference]: Start difference. First operand 1011 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:51,470 INFO L93 Difference]: Finished difference Result 2623 states and 4412 transitions. [2025-01-09 10:08:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:51,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:51,479 INFO L225 Difference]: With dead ends: 2623 [2025-01-09 10:08:51,479 INFO L226 Difference]: Without dead ends: 1615 [2025-01-09 10:08:51,482 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-01-09 10:08:51,482 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 350 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:51,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1278 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2025-01-09 10:08:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1612. [2025-01-09 10:08:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1132 states have (on average 1.5441696113074206) internal successors, (1748), 1139 states have internal predecessors, (1748), 471 states have call successors, (471), 8 states have call predecessors, (471), 8 states have return successors, (471), 464 states have call predecessors, (471), 471 states have call successors, (471) [2025-01-09 10:08:51,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2690 transitions. [2025-01-09 10:08:51,562 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2690 transitions. Word has length 685 [2025-01-09 10:08:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:51,563 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2690 transitions. [2025-01-09 10:08:51,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2690 transitions. [2025-01-09 10:08:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:51,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:51,597 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:08:51,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash 250773522, now seen corresponding path program 1 times [2025-01-09 10:08:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70663344] [2025-01-09 10:08:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:51,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:51,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:51,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:51,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:51,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70663344] [2025-01-09 10:08:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70663344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:51,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510458763] [2025-01-09 10:08:51,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:51,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:51,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:51,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:51,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,853 INFO L87 Difference]: Start difference. First operand 1612 states and 2690 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:51,990 INFO L93 Difference]: Finished difference Result 4425 states and 7324 transitions. [2025-01-09 10:08:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:52,005 INFO L225 Difference]: With dead ends: 4425 [2025-01-09 10:08:52,005 INFO L226 Difference]: Without dead ends: 2816 [2025-01-09 10:08:52,010 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-01-09 10:08:52,010 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 338 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:52,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2816 states. [2025-01-09 10:08:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2816 to 2812. [2025-01-09 10:08:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 1864 states have (on average 1.4785407725321889) internal successors, (2756), 1879 states have internal predecessors, (2756), 931 states have call successors, (931), 16 states have call predecessors, (931), 16 states have return successors, (931), 916 states have call predecessors, (931), 931 states have call successors, (931) [2025-01-09 10:08:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4618 transitions. [2025-01-09 10:08:52,252 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4618 transitions. Word has length 685 [2025-01-09 10:08:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:52,254 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4618 transitions. [2025-01-09 10:08:52,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4618 transitions. [2025-01-09 10:08:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:52,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:52,262 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:52,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:08:52,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:52,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -171928304, now seen corresponding path program 1 times [2025-01-09 10:08:52,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:52,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410892391] [2025-01-09 10:08:52,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:52,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:52,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:52,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:52,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:52,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:52,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410892391] [2025-01-09 10:08:52,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410892391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:52,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:52,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:52,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824746317] [2025-01-09 10:08:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:52,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:52,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:52,654 INFO L87 Difference]: Start difference. First operand 2812 states and 4618 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:52,779 INFO L93 Difference]: Finished difference Result 5621 states and 9233 transitions. [2025-01-09 10:08:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:52,811 INFO L225 Difference]: With dead ends: 5621 [2025-01-09 10:08:52,811 INFO L226 Difference]: Without dead ends: 2812 [2025-01-09 10:08:52,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:52,833 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 0 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:52,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1272 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2025-01-09 10:08:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812. [2025-01-09 10:08:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 1864 states have (on average 1.4763948497854078) internal successors, (2752), 1879 states have internal predecessors, (2752), 931 states have call successors, (931), 16 states have call predecessors, (931), 16 states have return successors, (931), 916 states have call predecessors, (931), 931 states have call successors, (931) [2025-01-09 10:08:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4614 transitions. [2025-01-09 10:08:53,014 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4614 transitions. Word has length 685 [2025-01-09 10:08:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:53,015 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4614 transitions. [2025-01-09 10:08:53,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4614 transitions. [2025-01-09 10:08:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:53,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:53,021 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:53,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:08:53,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:53,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1201287602, now seen corresponding path program 1 times [2025-01-09 10:08:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:53,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839779879] [2025-01-09 10:08:53,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:53,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:53,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:53,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:53,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839779879] [2025-01-09 10:08:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839779879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907434848] [2025-01-09 10:08:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:53,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:53,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,499 INFO L87 Difference]: Start difference. First operand 2812 states and 4614 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:53,825 INFO L93 Difference]: Finished difference Result 8430 states and 13836 transitions. [2025-01-09 10:08:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:53,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:53,864 INFO L225 Difference]: With dead ends: 8430 [2025-01-09 10:08:53,865 INFO L226 Difference]: Without dead ends: 5621 [2025-01-09 10:08:53,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,879 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 420 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:53,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2025-01-09 10:08:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5619. [2025-01-09 10:08:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5619 states, 3724 states have (on average 1.4758324382384533) internal successors, (5496), 3754 states have internal predecessors, (5496), 1862 states have call successors, (1862), 32 states have call predecessors, (1862), 32 states have return successors, (1862), 1832 states have call predecessors, (1862), 1862 states have call successors, (1862) [2025-01-09 10:08:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5619 states to 5619 states and 9220 transitions. [2025-01-09 10:08:54,374 INFO L78 Accepts]: Start accepts. Automaton has 5619 states and 9220 transitions. Word has length 685 [2025-01-09 10:08:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 5619 states and 9220 transitions. [2025-01-09 10:08:54,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:54,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5619 states and 9220 transitions. [2025-01-09 10:08:54,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:54,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:54,382 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:54,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:08:54,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:54,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:54,383 INFO L85 PathProgramCache]: Analyzing trace with hash -307801264, now seen corresponding path program 1 times [2025-01-09 10:08:54,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:54,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657849397] [2025-01-09 10:08:54,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:54,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:54,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:54,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:54,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:08:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:55,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657849397] [2025-01-09 10:08:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657849397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805470745] [2025-01-09 10:08:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:55,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:55,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:55,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:55,014 INFO L87 Difference]: Start difference. First operand 5619 states and 9220 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:55,558 INFO L93 Difference]: Finished difference Result 16237 states and 26600 transitions. [2025-01-09 10:08:55,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 685 [2025-01-09 10:08:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:55,622 INFO L225 Difference]: With dead ends: 16237 [2025-01-09 10:08:55,622 INFO L226 Difference]: Without dead ends: 10621 [2025-01-09 10:08:55,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:55,646 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 384 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:55,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1432 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2025-01-09 10:08:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 10611. [2025-01-09 10:08:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10611 states, 7044 states have (on average 1.4699034639409427) internal successors, (10354), 7106 states have internal predecessors, (10354), 3502 states have call successors, (3502), 64 states have call predecessors, (3502), 64 states have return successors, (3502), 3440 states have call predecessors, (3502), 3502 states have call successors, (3502) [2025-01-09 10:08:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10611 states to 10611 states and 17358 transitions. [2025-01-09 10:08:56,440 INFO L78 Accepts]: Start accepts. Automaton has 10611 states and 17358 transitions. Word has length 685 [2025-01-09 10:08:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 10611 states and 17358 transitions. [2025-01-09 10:08:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:08:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10611 states and 17358 transitions. [2025-01-09 10:08:56,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 10:08:56,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:56,455 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:56,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:08:56,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:56,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -199786346, now seen corresponding path program 1 times [2025-01-09 10:08:56,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:56,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928193260] [2025-01-09 10:08:56,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:56,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:56,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:56,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:56,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 84 proven. 228 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-01-09 10:08:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928193260] [2025-01-09 10:08:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928193260] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33224499] [2025-01-09 10:08:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:57,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:57,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:08:57,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:08:57,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 10:08:57,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 10:08:57,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:57,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:57,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 10:08:57,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 15236 proven. 198 refuted. 0 times theorem prover too weak. 6406 trivial. 0 not checked. [2025-01-09 10:08:58,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:08:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 114 proven. 198 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-01-09 10:08:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33224499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:08:59,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:08:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 10] total 17 [2025-01-09 10:08:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006150397] [2025-01-09 10:08:59,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:08:59,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 10:08:59,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:59,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 10:08:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:08:59,620 INFO L87 Difference]: Start difference. First operand 10611 states and 17358 transitions. Second operand has 17 states, 17 states have (on average 18.58823529411765) internal successors, (316), 17 states have internal predecessors, (316), 8 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 8 states have call predecessors, (249), 8 states have call successors, (249) [2025-01-09 10:09:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:02,825 INFO L93 Difference]: Finished difference Result 40763 states and 65031 transitions. [2025-01-09 10:09:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 10:09:02,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.58823529411765) internal successors, (316), 17 states have internal predecessors, (316), 8 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 8 states have call predecessors, (249), 8 states have call successors, (249) Word has length 685 [2025-01-09 10:09:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:02,956 INFO L225 Difference]: With dead ends: 40763 [2025-01-09 10:09:02,957 INFO L226 Difference]: Without dead ends: 30155 [2025-01-09 10:09:03,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1363 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=591, Invalid=1389, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 10:09:03,004 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 3001 mSDsluCounter, 1808 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3003 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:03,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3003 Valid, 2365 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:09:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30155 states. [2025-01-09 10:09:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30155 to 12699. [2025-01-09 10:09:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12699 states, 8604 states have (on average 1.441771269177127) internal successors, (12405), 8674 states have internal predecessors, (12405), 3806 states have call successors, (3806), 288 states have call predecessors, (3806), 288 states have return successors, (3806), 3736 states have call predecessors, (3806), 3806 states have call successors, (3806) [2025-01-09 10:09:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12699 states to 12699 states and 20017 transitions. [2025-01-09 10:09:04,615 INFO L78 Accepts]: Start accepts. Automaton has 12699 states and 20017 transitions. Word has length 685 [2025-01-09 10:09:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:04,616 INFO L471 AbstractCegarLoop]: Abstraction has 12699 states and 20017 transitions. [2025-01-09 10:09:04,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.58823529411765) internal successors, (316), 17 states have internal predecessors, (316), 8 states have call successors, (247), 4 states have call predecessors, (247), 6 states have return successors, (249), 8 states have call predecessors, (249), 8 states have call successors, (249) [2025-01-09 10:09:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12699 states and 20017 transitions. [2025-01-09 10:09:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 687 [2025-01-09 10:09:04,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:04,632 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:04,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:09:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:04,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -66112191, now seen corresponding path program 1 times [2025-01-09 10:09:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:04,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248624266] [2025-01-09 10:09:04,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:04,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:04,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 686 statements into 1 equivalence classes. [2025-01-09 10:09:04,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 686 of 686 statements. [2025-01-09 10:09:04,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:04,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:09:05,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248624266] [2025-01-09 10:09:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248624266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:05,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:05,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:09:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174856004] [2025-01-09 10:09:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:05,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:09:05,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:05,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:09:05,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:09:05,392 INFO L87 Difference]: Start difference. First operand 12699 states and 20017 transitions. Second operand has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:13,601 INFO L93 Difference]: Finished difference Result 106641 states and 171255 transitions. [2025-01-09 10:09:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:09:13,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 686 [2025-01-09 10:09:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:13,928 INFO L225 Difference]: With dead ends: 106641 [2025-01-09 10:09:13,929 INFO L226 Difference]: Without dead ends: 93945 [2025-01-09 10:09:14,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:09:14,056 INFO L435 NwaCegarLoop]: 1169 mSDtfsCounter, 3890 mSDsluCounter, 4271 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3890 SdHoareTripleChecker+Valid, 5440 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 656 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:14,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3890 Valid, 5440 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [656 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 10:09:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93945 states. [2025-01-09 10:09:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93945 to 24305. [2025-01-09 10:09:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24305 states, 16810 states have (on average 1.4453896490184415) internal successors, (24297), 16944 states have internal predecessors, (24297), 6814 states have call successors, (6814), 680 states have call predecessors, (6814), 680 states have return successors, (6814), 6680 states have call predecessors, (6814), 6814 states have call successors, (6814) [2025-01-09 10:09:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24305 states to 24305 states and 37925 transitions. [2025-01-09 10:09:17,666 INFO L78 Accepts]: Start accepts. Automaton has 24305 states and 37925 transitions. Word has length 686 [2025-01-09 10:09:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:17,667 INFO L471 AbstractCegarLoop]: Abstraction has 24305 states and 37925 transitions. [2025-01-09 10:09:17,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.5) internal successors, (164), 8 states have internal predecessors, (164), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24305 states and 37925 transitions. [2025-01-09 10:09:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-01-09 10:09:17,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:17,684 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:17,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:09:17,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1344034622, now seen corresponding path program 1 times [2025-01-09 10:09:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:17,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913290032] [2025-01-09 10:09:17,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:17,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:09:18,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:09:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 84 proven. 228 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-01-09 10:09:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913290032] [2025-01-09 10:09:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913290032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013827104] [2025-01-09 10:09:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:18,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:09:18,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:09:18,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-01-09 10:09:19,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-01-09 10:09:19,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:19,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:19,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1571 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:09:19,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 9968 proven. 204 refuted. 0 times theorem prover too weak. 11668 trivial. 0 not checked. [2025-01-09 10:09:19,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 108 proven. 204 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-01-09 10:09:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013827104] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:20,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-01-09 10:09:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499833615] [2025-01-09 10:09:20,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:20,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:09:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:20,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:09:20,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:09:20,288 INFO L87 Difference]: Start difference. First operand 24305 states and 37925 transitions. Second operand has 12 states, 12 states have (on average 25.166666666666668) internal successors, (302), 12 states have internal predecessors, (302), 5 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 5 states have call predecessors, (251), 5 states have call successors, (251) [2025-01-09 10:09:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:25,247 INFO L93 Difference]: Finished difference Result 67245 states and 105201 transitions. [2025-01-09 10:09:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 10:09:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 25.166666666666668) internal successors, (302), 12 states have internal predecessors, (302), 5 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 5 states have call predecessors, (251), 5 states have call successors, (251) Word has length 687 [2025-01-09 10:09:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:25,436 INFO L225 Difference]: With dead ends: 67245 [2025-01-09 10:09:25,436 INFO L226 Difference]: Without dead ends: 42943 [2025-01-09 10:09:25,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1400 GetRequests, 1373 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2025-01-09 10:09:25,503 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 2517 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:25,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 1874 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:09:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42943 states. [2025-01-09 10:09:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42943 to 12717. [2025-01-09 10:09:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12717 states, 8790 states have (on average 1.428896473265074) internal successors, (12560), 8852 states have internal predecessors, (12560), 3502 states have call successors, (3502), 424 states have call predecessors, (3502), 424 states have return successors, (3502), 3440 states have call predecessors, (3502), 3502 states have call successors, (3502) [2025-01-09 10:09:27,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12717 states to 12717 states and 19564 transitions. [2025-01-09 10:09:27,549 INFO L78 Accepts]: Start accepts. Automaton has 12717 states and 19564 transitions. Word has length 687 [2025-01-09 10:09:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:27,550 INFO L471 AbstractCegarLoop]: Abstraction has 12717 states and 19564 transitions. [2025-01-09 10:09:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.166666666666668) internal successors, (302), 12 states have internal predecessors, (302), 5 states have call successors, (249), 2 states have call predecessors, (249), 4 states have return successors, (251), 5 states have call predecessors, (251), 5 states have call successors, (251) [2025-01-09 10:09:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 12717 states and 19564 transitions. [2025-01-09 10:09:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 10:09:27,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:27,560 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:27,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 10:09:27,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:27,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:27,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash -17157853, now seen corresponding path program 1 times [2025-01-09 10:09:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991173708] [2025-01-09 10:09:27,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:27,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 10:09:27,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 10:09:27,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:27,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:09:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991173708] [2025-01-09 10:09:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991173708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:29,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566256257] [2025-01-09 10:09:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:29,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:29,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:29,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:29,116 INFO L87 Difference]: Start difference. First operand 12717 states and 19564 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:32,594 INFO L93 Difference]: Finished difference Result 36915 states and 56599 transitions. [2025-01-09 10:09:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:32,594 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 688 [2025-01-09 10:09:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:32,698 INFO L225 Difference]: With dead ends: 36915 [2025-01-09 10:09:32,698 INFO L226 Difference]: Without dead ends: 24201 [2025-01-09 10:09:32,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:32,735 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 815 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:32,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 2041 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:09:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24201 states. [2025-01-09 10:09:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24201 to 13445. [2025-01-09 10:09:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13445 states, 9518 states have (on average 1.4557680184912798) internal successors, (13856), 9580 states have internal predecessors, (13856), 3502 states have call successors, (3502), 424 states have call predecessors, (3502), 424 states have return successors, (3502), 3440 states have call predecessors, (3502), 3502 states have call successors, (3502) [2025-01-09 10:09:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13445 states to 13445 states and 20860 transitions. [2025-01-09 10:09:34,566 INFO L78 Accepts]: Start accepts. Automaton has 13445 states and 20860 transitions. Word has length 688 [2025-01-09 10:09:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:34,567 INFO L471 AbstractCegarLoop]: Abstraction has 13445 states and 20860 transitions. [2025-01-09 10:09:34,567 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13445 states and 20860 transitions. [2025-01-09 10:09:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-01-09 10:09:34,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:34,576 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:34,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:09:34,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 858861153, now seen corresponding path program 1 times [2025-01-09 10:09:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444865905] [2025-01-09 10:09:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:34,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-01-09 10:09:34,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-01-09 10:09:34,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:34,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:09:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:34,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444865905] [2025-01-09 10:09:34,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444865905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:34,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:34,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809463835] [2025-01-09 10:09:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:34,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:34,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:34,781 INFO L87 Difference]: Start difference. First operand 13445 states and 20860 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:38,371 INFO L93 Difference]: Finished difference Result 40585 states and 62766 transitions. [2025-01-09 10:09:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:38,372 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 688 [2025-01-09 10:09:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:38,467 INFO L225 Difference]: With dead ends: 40585 [2025-01-09 10:09:38,467 INFO L226 Difference]: Without dead ends: 27143 [2025-01-09 10:09:38,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:38,501 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 479 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:38,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1744 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:09:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27143 states. [2025-01-09 10:09:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27143 to 27141. [2025-01-09 10:09:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27141 states, 19224 states have (on average 1.4500624219725344) internal successors, (27876), 19348 states have internal predecessors, (27876), 7004 states have call successors, (7004), 912 states have call predecessors, (7004), 912 states have return successors, (7004), 6880 states have call predecessors, (7004), 7004 states have call successors, (7004) [2025-01-09 10:09:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27141 states to 27141 states and 41884 transitions. [2025-01-09 10:09:42,185 INFO L78 Accepts]: Start accepts. Automaton has 27141 states and 41884 transitions. Word has length 688 [2025-01-09 10:09:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:42,186 INFO L471 AbstractCegarLoop]: Abstraction has 27141 states and 41884 transitions. [2025-01-09 10:09:42,186 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, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 27141 states and 41884 transitions. [2025-01-09 10:09:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 10:09:42,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:42,200 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:42,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:09:42,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:42,201 INFO L85 PathProgramCache]: Analyzing trace with hash -824898630, now seen corresponding path program 1 times [2025-01-09 10:09:42,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:42,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262752650] [2025-01-09 10:09:42,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:42,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 10:09:42,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 10:09:42,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:42,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:09:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:42,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262752650] [2025-01-09 10:09:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262752650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:42,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:42,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333682866] [2025-01-09 10:09:42,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:42,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:42,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:42,469 INFO L87 Difference]: Start difference. First operand 27141 states and 41884 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:46,035 INFO L93 Difference]: Finished difference Result 55209 states and 85446 transitions. [2025-01-09 10:09:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:09:46,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) Word has length 689 [2025-01-09 10:09:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:46,153 INFO L225 Difference]: With dead ends: 55209 [2025-01-09 10:09:46,153 INFO L226 Difference]: Without dead ends: 28071 [2025-01-09 10:09:46,218 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-01-09 10:09:46,218 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 763 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:46,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1967 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:09:46,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28071 states. [2025-01-09 10:09:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28071 to 27141. [2025-01-09 10:09:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27141 states, 19224 states have (on average 1.4434040782355388) internal successors, (27748), 19348 states have internal predecessors, (27748), 7004 states have call successors, (7004), 912 states have call predecessors, (7004), 912 states have return successors, (7004), 6880 states have call predecessors, (7004), 7004 states have call successors, (7004) [2025-01-09 10:09:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27141 states to 27141 states and 41756 transitions. [2025-01-09 10:09:50,448 INFO L78 Accepts]: Start accepts. Automaton has 27141 states and 41756 transitions. Word has length 689 [2025-01-09 10:09:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 27141 states and 41756 transitions. [2025-01-09 10:09:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 1 states have call predecessors, (105), 1 states have call successors, (105) [2025-01-09 10:09:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 27141 states and 41756 transitions. [2025-01-09 10:09:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 10:09:50,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:50,462 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:50,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:09:50,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:50,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash 245458613, now seen corresponding path program 1 times [2025-01-09 10:09:50,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:50,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173303582] [2025-01-09 10:09:50,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:50,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 10:09:50,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 10:09:50,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:50,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21840 trivial. 0 not checked. [2025-01-09 10:09:51,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:51,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173303582] [2025-01-09 10:09:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173303582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:51,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:51,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:09:51,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151899558] [2025-01-09 10:09:51,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:09:51,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:51,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:09:51,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:09:51,312 INFO L87 Difference]: Start difference. First operand 27141 states and 41756 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 2 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 2 states have call predecessors, (105), 2 states have call successors, (105)