./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.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-21.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 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:03:11,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:03:11,897 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:03:11,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:03:11,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:03:11,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:03:11,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:03:11,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:03:11,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:03:11,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:03:11,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:03:11,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:03:11,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:03:11,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:11,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:11,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:03:11,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:03:11,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:03:11,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:03:11,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:03:11,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:03:11,936 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 -> 4e26c4f9f4bd36e827f5cc020962f05d0934fda94760f725a49c7754f36caf1f [2025-01-09 10:03:12,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:03:12,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:03:12,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:03:12,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:03:12,227 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:03:12,229 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-21.i [2025-01-09 10:03:13,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead6b48a3/7d6c413b31d34d328c6cc02fef5657f4/FLAG749582985 [2025-01-09 10:03:13,945 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:03:13,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-01-09 10:03:13,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead6b48a3/7d6c413b31d34d328c6cc02fef5657f4/FLAG749582985 [2025-01-09 10:03:14,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead6b48a3/7d6c413b31d34d328c6cc02fef5657f4 [2025-01-09 10:03:14,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:03:14,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:03:14,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:14,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:03:14,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:03:14,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e0bc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14, skipping insertion in model container [2025-01-09 10:03:14,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:03:14,374 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-21.i[916,929] [2025-01-09 10:03:14,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:14,527 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:03:14,534 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-21.i[916,929] [2025-01-09 10:03:14,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:03:14,611 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:03:14,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14 WrapperNode [2025-01-09 10:03:14,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:03:14,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:14,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:03:14,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:03:14,626 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:03:14" (1/1) ... [2025-01-09 10:03:14,649 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:03:14" (1/1) ... [2025-01-09 10:03:14,699 INFO L138 Inliner]: procedures = 26, calls = 117, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 848 [2025-01-09 10:03:14,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:03:14,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:03:14,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:03:14,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:03:14,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,735 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:03:14,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:03:14,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:03:14,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:03:14,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:03:14,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (1/1) ... [2025-01-09 10:03:14,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:03:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:14,810 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:03:14,814 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:03:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:03:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:03:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:03:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:03:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:03:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:03:14,958 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:03:14,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:03:15,968 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 10:03:15,969 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:03:15,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:03:15,984 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:03:15,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:15 BoogieIcfgContainer [2025-01-09 10:03:15,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:03:15,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:03:15,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:03:15,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:03:15,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:03:14" (1/3) ... [2025-01-09 10:03:15,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db2e014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:15, skipping insertion in model container [2025-01-09 10:03:15,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:03:14" (2/3) ... [2025-01-09 10:03:15,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db2e014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:03:15, skipping insertion in model container [2025-01-09 10:03:15,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:03:15" (3/3) ... [2025-01-09 10:03:15,995 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i [2025-01-09 10:03:16,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:03:16,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-21.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:03:16,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:03:16,065 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;@75e4cfad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:03:16,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:03:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 10:03:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-01-09 10:03:16,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:16,089 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:16,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:16,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2031521096, now seen corresponding path program 1 times [2025-01-09 10:03:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:16,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302040681] [2025-01-09 10:03:16,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 10:03:16,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 10:03:16,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:16,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 206 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-01-09 10:03:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302040681] [2025-01-09 10:03:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302040681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:03:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988787522] [2025-01-09 10:03:16,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:03:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:03:16,645 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:03:16,647 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:03:16,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 10:03:17,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 10:03:17,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:17,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:17,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 1536 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:03:17,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:03:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 21218 trivial. 0 not checked. [2025-01-09 10:03:17,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:03:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988787522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:03:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:03:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200516996] [2025-01-09 10:03:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:03:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:17,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:03:17,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:03:17,118 INFO L87 Difference]: Start difference. First operand has 346 states, 239 states have (on average 1.598326359832636) internal successors, (382), 240 states have internal predecessors, (382), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 10:03:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:17,177 INFO L93 Difference]: Finished difference Result 686 states and 1279 transitions. [2025-01-09 10:03:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:03:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-01-09 10:03:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:17,186 INFO L225 Difference]: With dead ends: 686 [2025-01-09 10:03:17,186 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 10:03:17,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 670 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:03:17,196 INFO L435 NwaCegarLoop]: 585 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, 585 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:03:17,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 10:03:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-01-09 10:03:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 237 states have (on average 1.590717299578059) internal successors, (377), 237 states have internal predecessors, (377), 104 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-01-09 10:03:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 585 transitions. [2025-01-09 10:03:17,255 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 585 transitions. Word has length 669 [2025-01-09 10:03:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:17,256 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 585 transitions. [2025-01-09 10:03:17,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (104), 2 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 10:03:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 585 transitions. [2025-01-09 10:03:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-01-09 10:03:17,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:17,265 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:03:17,466 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:03:17,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1765698068, now seen corresponding path program 1 times [2025-01-09 10:03:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143118031] [2025-01-09 10:03:17,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:17,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 10:03:17,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 10:03:17,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:17,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:18,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143118031] [2025-01-09 10:03:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143118031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:18,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427496167] [2025-01-09 10:03:18,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:18,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:18,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:18,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:18,526 INFO L87 Difference]: Start difference. First operand 343 states and 585 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 10:03:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:18,852 INFO L93 Difference]: Finished difference Result 1022 states and 1747 transitions. [2025-01-09 10:03:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) Word has length 669 [2025-01-09 10:03:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:18,863 INFO L225 Difference]: With dead ends: 1022 [2025-01-09 10:03:18,867 INFO L226 Difference]: Without dead ends: 682 [2025-01-09 10:03:18,869 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:03:18,871 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 772 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:18,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1368 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-01-09 10:03:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2025-01-09 10:03:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 469 states have (on average 1.5906183368869935) internal successors, (746), 469 states have internal predecessors, (746), 208 states have call successors, (208), 2 states have call predecessors, (208), 2 states have return successors, (208), 208 states have call predecessors, (208), 208 states have call successors, (208) [2025-01-09 10:03:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1162 transitions. [2025-01-09 10:03:18,959 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1162 transitions. Word has length 669 [2025-01-09 10:03:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:18,960 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1162 transitions. [2025-01-09 10:03:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 2 states have call predecessors, (104), 2 states have call successors, (104) [2025-01-09 10:03:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1162 transitions. [2025-01-09 10:03:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 10:03:18,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:18,971 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:18,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:03:18,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1179056209, now seen corresponding path program 1 times [2025-01-09 10:03:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:18,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583783080] [2025-01-09 10:03:18,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:19,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 10:03:19,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 10:03:19,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583783080] [2025-01-09 10:03:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583783080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734322243] [2025-01-09 10:03:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:19,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:19,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:19,221 INFO L87 Difference]: Start difference. First operand 680 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:19,301 INFO L93 Difference]: Finished difference Result 2030 states and 3472 transitions. [2025-01-09 10:03:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:19,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-01-09 10:03:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:19,309 INFO L225 Difference]: With dead ends: 2030 [2025-01-09 10:03:19,309 INFO L226 Difference]: Without dead ends: 1353 [2025-01-09 10:03:19,311 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:03:19,312 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 571 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:19,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1699 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-01-09 10:03:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1351. [2025-01-09 10:03:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 930 states have (on average 1.5849462365591398) internal successors, (1474), 930 states have internal predecessors, (1474), 416 states have call successors, (416), 4 states have call predecessors, (416), 4 states have return successors, (416), 416 states have call predecessors, (416), 416 states have call successors, (416) [2025-01-09 10:03:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 2306 transitions. [2025-01-09 10:03:19,515 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 2306 transitions. Word has length 670 [2025-01-09 10:03:19,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:19,516 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 2306 transitions. [2025-01-09 10:03:19,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2306 transitions. [2025-01-09 10:03:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 10:03:19,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:19,529 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:19,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:03:19,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:19,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:19,530 INFO L85 PathProgramCache]: Analyzing trace with hash -898280689, now seen corresponding path program 1 times [2025-01-09 10:03:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627573273] [2025-01-09 10:03:19,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:19,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:19,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 10:03:19,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 10:03:19,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:19,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627573273] [2025-01-09 10:03:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627573273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:19,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960962969] [2025-01-09 10:03:19,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:19,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:19,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:19,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:19,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:19,810 INFO L87 Difference]: Start difference. First operand 1351 states and 2306 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:19,920 INFO L93 Difference]: Finished difference Result 3395 states and 5819 transitions. [2025-01-09 10:03:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-01-09 10:03:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:19,934 INFO L225 Difference]: With dead ends: 3395 [2025-01-09 10:03:19,934 INFO L226 Difference]: Without dead ends: 2047 [2025-01-09 10:03:19,939 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:03:19,940 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 337 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:19,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1422 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2025-01-09 10:03:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2016. [2025-01-09 10:03:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 1503 states have (on average 1.6307385229540918) internal successors, (2451), 1507 states have internal predecessors, (2451), 504 states have call successors, (504), 8 states have call predecessors, (504), 8 states have return successors, (504), 500 states have call predecessors, (504), 504 states have call successors, (504) [2025-01-09 10:03:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3459 transitions. [2025-01-09 10:03:20,121 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3459 transitions. Word has length 670 [2025-01-09 10:03:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:20,122 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3459 transitions. [2025-01-09 10:03:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:20,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3459 transitions. [2025-01-09 10:03:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 10:03:20,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:20,129 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:03:20,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1942525502, now seen corresponding path program 1 times [2025-01-09 10:03:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966374123] [2025-01-09 10:03:20,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:20,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:20,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 10:03:20,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 10:03:20,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:20,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966374123] [2025-01-09 10:03:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966374123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:20,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64970039] [2025-01-09 10:03:20,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:20,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:20,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:20,501 INFO L87 Difference]: Start difference. First operand 2016 states and 3459 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:20,851 INFO L93 Difference]: Finished difference Result 4732 states and 8125 transitions. [2025-01-09 10:03:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:20,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-01-09 10:03:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:20,868 INFO L225 Difference]: With dead ends: 4732 [2025-01-09 10:03:20,869 INFO L226 Difference]: Without dead ends: 2719 [2025-01-09 10:03:20,874 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:03:20,876 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 965 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:20,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 2104 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2025-01-09 10:03:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2712. [2025-01-09 10:03:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2079 states have (on average 1.6459836459836459) internal successors, (3422), 2087 states have internal predecessors, (3422), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2025-01-09 10:03:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 4662 transitions. [2025-01-09 10:03:21,082 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 4662 transitions. Word has length 670 [2025-01-09 10:03:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,082 INFO L471 AbstractCegarLoop]: Abstraction has 2712 states and 4662 transitions. [2025-01-09 10:03:21,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 4662 transitions. [2025-01-09 10:03:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 10:03:21,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,092 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:03:21,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1702285756, now seen corresponding path program 1 times [2025-01-09 10:03:21,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982058882] [2025-01-09 10:03:21,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:21,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 10:03:21,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 10:03:21,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:21,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982058882] [2025-01-09 10:03:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982058882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200133074] [2025-01-09 10:03:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:21,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:21,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:21,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:21,282 INFO L87 Difference]: Start difference. First operand 2712 states and 4662 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:21,488 INFO L93 Difference]: Finished difference Result 8130 states and 13980 transitions. [2025-01-09 10:03:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-01-09 10:03:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:21,517 INFO L225 Difference]: With dead ends: 8130 [2025-01-09 10:03:21,517 INFO L226 Difference]: Without dead ends: 5421 [2025-01-09 10:03:21,524 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:03:21,525 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 564 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:21,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1199 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5421 states. [2025-01-09 10:03:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5421 to 5419. [2025-01-09 10:03:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5419 states, 4154 states have (on average 1.6417910447761195) internal successors, (6820), 4170 states have internal predecessors, (6820), 1240 states have call successors, (1240), 24 states have call predecessors, (1240), 24 states have return successors, (1240), 1224 states have call predecessors, (1240), 1240 states have call successors, (1240) [2025-01-09 10:03:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5419 states to 5419 states and 9300 transitions. [2025-01-09 10:03:21,968 INFO L78 Accepts]: Start accepts. Automaton has 5419 states and 9300 transitions. Word has length 670 [2025-01-09 10:03:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:21,969 INFO L471 AbstractCegarLoop]: Abstraction has 5419 states and 9300 transitions. [2025-01-09 10:03:21,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5419 states and 9300 transitions. [2025-01-09 10:03:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2025-01-09 10:03:21,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:21,979 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:03:21,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:21,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash 543293698, now seen corresponding path program 1 times [2025-01-09 10:03:21,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:21,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100107143] [2025-01-09 10:03:21,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:21,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:22,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 670 statements into 1 equivalence classes. [2025-01-09 10:03:22,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 670 of 670 statements. [2025-01-09 10:03:22,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:22,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100107143] [2025-01-09 10:03:22,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100107143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:22,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:22,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:22,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980461453] [2025-01-09 10:03:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:22,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:22,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:22,398 INFO L87 Difference]: Start difference. First operand 5419 states and 9300 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:22,855 INFO L93 Difference]: Finished difference Result 14131 states and 24248 transitions. [2025-01-09 10:03:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 670 [2025-01-09 10:03:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:22,917 INFO L225 Difference]: With dead ends: 14131 [2025-01-09 10:03:22,917 INFO L226 Difference]: Without dead ends: 8715 [2025-01-09 10:03:22,938 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:03:22,939 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 359 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:22,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1280 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:03:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8715 states. [2025-01-09 10:03:23,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8715 to 8711. [2025-01-09 10:03:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8711 states, 6694 states have (on average 1.6402748730206156) internal successors, (10980), 6722 states have internal predecessors, (10980), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-01-09 10:03:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8711 states to 8711 states and 14932 transitions. [2025-01-09 10:03:23,585 INFO L78 Accepts]: Start accepts. Automaton has 8711 states and 14932 transitions. Word has length 670 [2025-01-09 10:03:23,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 8711 states and 14932 transitions. [2025-01-09 10:03:23,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8711 states and 14932 transitions. [2025-01-09 10:03:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-01-09 10:03:23,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:23,598 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:03:23,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 120864817, now seen corresponding path program 1 times [2025-01-09 10:03:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665143337] [2025-01-09 10:03:23,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:23,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 10:03:23,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 10:03:23,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:23,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:23,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665143337] [2025-01-09 10:03:23,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665143337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:23,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:23,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:23,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860764354] [2025-01-09 10:03:23,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:23,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:23,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:23,781 INFO L87 Difference]: Start difference. First operand 8711 states and 14932 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:23,938 INFO L93 Difference]: Finished difference Result 13079 states and 22435 transitions. [2025-01-09 10:03:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:23,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-01-09 10:03:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:23,966 INFO L225 Difference]: With dead ends: 13079 [2025-01-09 10:03:23,966 INFO L226 Difference]: Without dead ends: 4371 [2025-01-09 10:03:23,987 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:03:23,988 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 555 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:23,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 571 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4371 states. [2025-01-09 10:03:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4371 to 4371. [2025-01-09 10:03:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4371 states, 3362 states have (on average 1.6347412254610352) internal successors, (5496), 3376 states have internal predecessors, (5496), 988 states have call successors, (988), 20 states have call predecessors, (988), 20 states have return successors, (988), 974 states have call predecessors, (988), 988 states have call successors, (988) [2025-01-09 10:03:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4371 states to 4371 states and 7472 transitions. [2025-01-09 10:03:24,289 INFO L78 Accepts]: Start accepts. Automaton has 4371 states and 7472 transitions. Word has length 671 [2025-01-09 10:03:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:24,291 INFO L471 AbstractCegarLoop]: Abstraction has 4371 states and 7472 transitions. [2025-01-09 10:03:24,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4371 states and 7472 transitions. [2025-01-09 10:03:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-01-09 10:03:24,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:24,297 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:24,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:03:24,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:24,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1381782067, now seen corresponding path program 1 times [2025-01-09 10:03:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139188671] [2025-01-09 10:03:24,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:24,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 10:03:24,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 10:03:24,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:24,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:24,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139188671] [2025-01-09 10:03:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139188671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406647558] [2025-01-09 10:03:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:24,466 INFO L87 Difference]: Start difference. First operand 4371 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:24,737 INFO L93 Difference]: Finished difference Result 13107 states and 22410 transitions. [2025-01-09 10:03:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-01-09 10:03:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:24,765 INFO L225 Difference]: With dead ends: 13107 [2025-01-09 10:03:24,766 INFO L226 Difference]: Without dead ends: 8739 [2025-01-09 10:03:24,776 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:03:24,777 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 559 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1613 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:03:24,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1613 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8739 states. [2025-01-09 10:03:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8739 to 8737. [2025-01-09 10:03:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8737 states, 6720 states have (on average 1.6261904761904762) internal successors, (10928), 6748 states have internal predecessors, (10928), 1976 states have call successors, (1976), 40 states have call predecessors, (1976), 40 states have return successors, (1976), 1948 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-01-09 10:03:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8737 states to 8737 states and 14880 transitions. [2025-01-09 10:03:25,279 INFO L78 Accepts]: Start accepts. Automaton has 8737 states and 14880 transitions. Word has length 671 [2025-01-09 10:03:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:25,280 INFO L471 AbstractCegarLoop]: Abstraction has 8737 states and 14880 transitions. [2025-01-09 10:03:25,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8737 states and 14880 transitions. [2025-01-09 10:03:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-01-09 10:03:25,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:25,291 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:25,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:25,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash 680182193, now seen corresponding path program 1 times [2025-01-09 10:03:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625525389] [2025-01-09 10:03:25,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:25,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 10:03:25,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 10:03:25,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:25,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:25,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625525389] [2025-01-09 10:03:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625525389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:25,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:25,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:25,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155611952] [2025-01-09 10:03:25,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:25,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:25,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:25,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:25,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:25,509 INFO L87 Difference]: Start difference. First operand 8737 states and 14880 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:26,156 INFO L93 Difference]: Finished difference Result 26005 states and 44274 transitions. [2025-01-09 10:03:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-01-09 10:03:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:26,236 INFO L225 Difference]: With dead ends: 26005 [2025-01-09 10:03:26,237 INFO L226 Difference]: Without dead ends: 17271 [2025-01-09 10:03:26,278 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:03:26,278 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 540 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:26,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1197 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17271 states. [2025-01-09 10:03:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17271 to 17269. [2025-01-09 10:03:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17269 states, 13236 states have (on average 1.614687216681777) internal successors, (21372), 13292 states have internal predecessors, (21372), 3952 states have call successors, (3952), 80 states have call predecessors, (3952), 80 states have return successors, (3952), 3896 states have call predecessors, (3952), 3952 states have call successors, (3952) [2025-01-09 10:03:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17269 states to 17269 states and 29276 transitions. [2025-01-09 10:03:27,359 INFO L78 Accepts]: Start accepts. Automaton has 17269 states and 29276 transitions. Word has length 671 [2025-01-09 10:03:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:27,360 INFO L471 AbstractCegarLoop]: Abstraction has 17269 states and 29276 transitions. [2025-01-09 10:03:27,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 17269 states and 29276 transitions. [2025-01-09 10:03:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-01-09 10:03:27,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:27,371 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:03:27,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -646939347, now seen corresponding path program 1 times [2025-01-09 10:03:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127937109] [2025-01-09 10:03:27,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:27,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:27,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 10:03:27,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 10:03:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127937109] [2025-01-09 10:03:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127937109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918173445] [2025-01-09 10:03:27,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:27,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:27,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:27,633 INFO L87 Difference]: Start difference. First operand 17269 states and 29276 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:28,147 INFO L93 Difference]: Finished difference Result 34535 states and 58549 transitions. [2025-01-09 10:03:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 671 [2025-01-09 10:03:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:28,223 INFO L225 Difference]: With dead ends: 34535 [2025-01-09 10:03:28,224 INFO L226 Difference]: Without dead ends: 17269 [2025-01-09 10:03:28,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:28,261 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 567 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:28,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1133 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17269 states. [2025-01-09 10:03:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17269 to 17269. [2025-01-09 10:03:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17269 states, 13236 states have (on average 1.6110607434270172) internal successors, (21324), 13292 states have internal predecessors, (21324), 3952 states have call successors, (3952), 80 states have call predecessors, (3952), 80 states have return successors, (3952), 3896 states have call predecessors, (3952), 3952 states have call successors, (3952) [2025-01-09 10:03:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17269 states to 17269 states and 29228 transitions. [2025-01-09 10:03:29,168 INFO L78 Accepts]: Start accepts. Automaton has 17269 states and 29228 transitions. Word has length 671 [2025-01-09 10:03:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:29,169 INFO L471 AbstractCegarLoop]: Abstraction has 17269 states and 29228 transitions. [2025-01-09 10:03:29,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17269 states and 29228 transitions. [2025-01-09 10:03:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:29,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:29,180 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:29,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:29,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash -423931943, now seen corresponding path program 1 times [2025-01-09 10:03:29,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:29,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060539557] [2025-01-09 10:03:29,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:29,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:29,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:29,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:29,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:29,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:29,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060539557] [2025-01-09 10:03:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060539557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:29,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:29,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:03:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636151879] [2025-01-09 10:03:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:29,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:03:29,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:29,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:03:29,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:29,569 INFO L87 Difference]: Start difference. First operand 17269 states and 29228 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:31,430 INFO L93 Difference]: Finished difference Result 38841 states and 65640 transitions. [2025-01-09 10:03:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:03:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-01-09 10:03:31,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:31,514 INFO L225 Difference]: With dead ends: 38841 [2025-01-09 10:03:31,514 INFO L226 Difference]: Without dead ends: 21575 [2025-01-09 10:03:31,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:03:31,549 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 1914 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:31,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 1924 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:03:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21575 states. [2025-01-09 10:03:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21575 to 18785. [2025-01-09 10:03:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18785 states, 14528 states have (on average 1.6098568281938326) internal successors, (23388), 14592 states have internal predecessors, (23388), 4160 states have call successors, (4160), 96 states have call predecessors, (4160), 96 states have return successors, (4160), 4096 states have call predecessors, (4160), 4160 states have call successors, (4160) [2025-01-09 10:03:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18785 states to 18785 states and 31708 transitions. [2025-01-09 10:03:33,035 INFO L78 Accepts]: Start accepts. Automaton has 18785 states and 31708 transitions. Word has length 673 [2025-01-09 10:03:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 18785 states and 31708 transitions. [2025-01-09 10:03:33,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18785 states and 31708 transitions. [2025-01-09 10:03:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:33,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:33,046 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:03:33,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:33,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1142826007, now seen corresponding path program 1 times [2025-01-09 10:03:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:33,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444946437] [2025-01-09 10:03:33,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:33,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:33,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:33,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:33,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:33,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:33,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444946437] [2025-01-09 10:03:33,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444946437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:33,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:33,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:33,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225581596] [2025-01-09 10:03:33,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:33,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:33,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:33,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:33,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:33,311 INFO L87 Difference]: Start difference. First operand 18785 states and 31708 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:34,760 INFO L93 Difference]: Finished difference Result 48713 states and 81270 transitions. [2025-01-09 10:03:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:34,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-01-09 10:03:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:34,913 INFO L225 Difference]: With dead ends: 48713 [2025-01-09 10:03:34,913 INFO L226 Difference]: Without dead ends: 29931 [2025-01-09 10:03:34,970 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:03:34,970 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 392 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:34,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 1171 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29931 states. [2025-01-09 10:03:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29931 to 18873. [2025-01-09 10:03:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18873 states, 14616 states have (on average 1.6061850027367268) internal successors, (23476), 14680 states have internal predecessors, (23476), 4160 states have call successors, (4160), 96 states have call predecessors, (4160), 96 states have return successors, (4160), 4096 states have call predecessors, (4160), 4160 states have call successors, (4160) [2025-01-09 10:03:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18873 states to 18873 states and 31796 transitions. [2025-01-09 10:03:37,161 INFO L78 Accepts]: Start accepts. Automaton has 18873 states and 31796 transitions. Word has length 673 [2025-01-09 10:03:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:37,162 INFO L471 AbstractCegarLoop]: Abstraction has 18873 states and 31796 transitions. [2025-01-09 10:03:37,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18873 states and 31796 transitions. [2025-01-09 10:03:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:37,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:37,171 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:03:37,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:37,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -546117735, now seen corresponding path program 1 times [2025-01-09 10:03:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:37,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779400348] [2025-01-09 10:03:37,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:37,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:37,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:37,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:37,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779400348] [2025-01-09 10:03:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779400348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:37,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:37,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:03:37,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56345311] [2025-01-09 10:03:37,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:37,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:03:37,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:37,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:03:37,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:37,698 INFO L87 Difference]: Start difference. First operand 18873 states and 31796 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:38,734 INFO L93 Difference]: Finished difference Result 33603 states and 56591 transitions. [2025-01-09 10:03:38,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:03:38,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-01-09 10:03:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:38,822 INFO L225 Difference]: With dead ends: 33603 [2025-01-09 10:03:38,822 INFO L226 Difference]: Without dead ends: 27773 [2025-01-09 10:03:38,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:03:38,843 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 845 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:38,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 3692 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:03:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27773 states. [2025-01-09 10:03:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27773 to 27753. [2025-01-09 10:03:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27753 states, 22144 states have (on average 1.6157875722543353) internal successors, (35780), 22256 states have internal predecessors, (35780), 5448 states have call successors, (5448), 160 states have call predecessors, (5448), 160 states have return successors, (5448), 5336 states have call predecessors, (5448), 5448 states have call successors, (5448) [2025-01-09 10:03:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27753 states to 27753 states and 46676 transitions. [2025-01-09 10:03:40,363 INFO L78 Accepts]: Start accepts. Automaton has 27753 states and 46676 transitions. Word has length 673 [2025-01-09 10:03:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:40,364 INFO L471 AbstractCegarLoop]: Abstraction has 27753 states and 46676 transitions. [2025-01-09 10:03:40,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 27753 states and 46676 transitions. [2025-01-09 10:03:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:40,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:40,380 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:40,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:03:40,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:40,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1330365083, now seen corresponding path program 1 times [2025-01-09 10:03:40,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:40,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558804696] [2025-01-09 10:03:40,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:40,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:40,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:40,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:40,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:40,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558804696] [2025-01-09 10:03:41,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558804696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:41,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:41,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:41,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790385091] [2025-01-09 10:03:41,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:41,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:41,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:41,013 INFO L87 Difference]: Start difference. First operand 27753 states and 46676 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:43,586 INFO L93 Difference]: Finished difference Result 83723 states and 140181 transitions. [2025-01-09 10:03:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:03:43,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-01-09 10:03:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:43,778 INFO L225 Difference]: With dead ends: 83723 [2025-01-09 10:03:43,778 INFO L226 Difference]: Without dead ends: 55701 [2025-01-09 10:03:43,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:03:43,859 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 749 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:43,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1610 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:03:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55701 states. [2025-01-09 10:03:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55701 to 50249. [2025-01-09 10:03:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50249 states, 40160 states have (on average 1.6163346613545817) internal successors, (64912), 40408 states have internal predecessors, (64912), 9768 states have call successors, (9768), 320 states have call predecessors, (9768), 320 states have return successors, (9768), 9520 states have call predecessors, (9768), 9768 states have call successors, (9768) [2025-01-09 10:03:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50249 states to 50249 states and 84448 transitions. [2025-01-09 10:03:47,089 INFO L78 Accepts]: Start accepts. Automaton has 50249 states and 84448 transitions. Word has length 673 [2025-01-09 10:03:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 50249 states and 84448 transitions. [2025-01-09 10:03:47,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50249 states and 84448 transitions. [2025-01-09 10:03:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:47,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:47,114 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:47,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 10:03:47,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:47,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:47,115 INFO L85 PathProgramCache]: Analyzing trace with hash -19802149, now seen corresponding path program 1 times [2025-01-09 10:03:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727977017] [2025-01-09 10:03:47,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:47,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:47,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:47,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:47,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727977017] [2025-01-09 10:03:47,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727977017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:47,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:47,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761947016] [2025-01-09 10:03:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:47,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:47,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:47,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:47,578 INFO L87 Difference]: Start difference. First operand 50249 states and 84448 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:48,761 INFO L93 Difference]: Finished difference Result 75373 states and 126875 transitions. [2025-01-09 10:03:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:48,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) Word has length 673 [2025-01-09 10:03:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:48,872 INFO L225 Difference]: With dead ends: 75373 [2025-01-09 10:03:48,872 INFO L226 Difference]: Without dead ends: 25127 [2025-01-09 10:03:48,946 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:03:48,947 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 569 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25127 states. [2025-01-09 10:03:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25127 to 25127. [2025-01-09 10:03:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25127 states, 20082 states have (on average 1.612887162633204) internal successors, (32390), 20206 states have internal predecessors, (32390), 4884 states have call successors, (4884), 160 states have call predecessors, (4884), 160 states have return successors, (4884), 4760 states have call predecessors, (4884), 4884 states have call successors, (4884) [2025-01-09 10:03:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25127 states to 25127 states and 42158 transitions. [2025-01-09 10:03:50,244 INFO L78 Accepts]: Start accepts. Automaton has 25127 states and 42158 transitions. Word has length 673 [2025-01-09 10:03:50,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:50,245 INFO L471 AbstractCegarLoop]: Abstraction has 25127 states and 42158 transitions. [2025-01-09 10:03:50,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104) [2025-01-09 10:03:50,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25127 states and 42158 transitions. [2025-01-09 10:03:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2025-01-09 10:03:50,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:50,256 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:50,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 10:03:50,256 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:50,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash -875494115, now seen corresponding path program 1 times [2025-01-09 10:03:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387016007] [2025-01-09 10:03:50,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:50,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 673 statements into 1 equivalence classes. [2025-01-09 10:03:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 673 of 673 statements. [2025-01-09 10:03:50,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:50,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21424 trivial. 0 not checked. [2025-01-09 10:03:50,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:50,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387016007] [2025-01-09 10:03:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387016007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341056310] [2025-01-09 10:03:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:50,509 INFO L87 Difference]: Start difference. First operand 25127 states and 42158 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (104), 1 states have call predecessors, (104), 1 states have return successors, (104), 1 states have call predecessors, (104), 1 states have call successors, (104)