/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive/Fibonacci03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-03 01:11:26,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-03 01:11:26,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-03 01:11:27,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-03 01:11:27,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-03 01:11:27,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-03 01:11:27,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-03 01:11:27,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-03 01:11:27,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-03 01:11:27,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-03 01:11:27,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-03 01:11:27,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-03 01:11:27,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-03 01:11:27,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-03 01:11:27,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-03 01:11:27,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-03 01:11:27,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-03 01:11:27,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-03 01:11:27,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-03 01:11:27,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-03 01:11:27,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-03 01:11:27,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-03 01:11:27,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-03 01:11:27,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-03 01:11:27,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-03 01:11:27,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-03 01:11:27,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-03 01:11:27,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-03 01:11:27,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-03 01:11:27,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-03 01:11:27,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-03 01:11:27,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-03 01:11:27,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-03 01:11:27,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-03 01:11:27,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-03 01:11:27,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-03 01:11:27,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-03 01:11:27,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-03 01:11:27,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-03 01:11:27,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-03 01:11:27,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-03 01:11:27,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-03 01:11:27,101 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-03 01:11:27,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-03 01:11:27,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-03 01:11:27,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-03 01:11:27,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-03 01:11:27,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-03 01:11:27,103 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-03 01:11:27,103 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-03 01:11:27,103 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-03 01:11:27,103 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-03 01:11:27,104 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-03 01:11:27,104 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-03 01:11:27,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-03 01:11:27,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-03 01:11:27,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-03 01:11:27,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:11:27,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-03 01:11:27,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-03 01:11:27,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-03 01:11:27,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-03 01:11:27,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-03 01:11:27,306 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-03 01:11:27,306 INFO L275 PluginConnector]: CDTParser initialized [2023-04-03 01:11:27,307 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci03.c [2023-04-03 01:11:28,202 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-03 01:11:28,336 INFO L351 CDTParser]: Found 1 translation units. [2023-04-03 01:11:28,337 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c [2023-04-03 01:11:28,340 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b2f7482/2ed28d66594f468abf15d6e785e8b430/FLAG4b73dc75d [2023-04-03 01:11:28,763 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76b2f7482/2ed28d66594f468abf15d6e785e8b430 [2023-04-03 01:11:28,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-03 01:11:28,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-03 01:11:28,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-03 01:11:28,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-03 01:11:28,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-03 01:11:28,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582e245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28, skipping insertion in model container [2023-04-03 01:11:28,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-03 01:11:28,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-03 01:11:28,879 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2023-04-03 01:11:28,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:11:28,891 INFO L203 MainTranslator]: Completed pre-run [2023-04-03 01:11:28,901 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci03.c[788,801] [2023-04-03 01:11:28,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-03 01:11:28,911 INFO L208 MainTranslator]: Completed translation [2023-04-03 01:11:28,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28 WrapperNode [2023-04-03 01:11:28,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-03 01:11:28,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-03 01:11:28,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-03 01:11:28,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-03 01:11:28,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-03 01:11:28,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-03 01:11:28,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-03 01:11:28,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-03 01:11:28,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (1/1) ... [2023-04-03 01:11:28,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-03 01:11:28,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:28,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-03 01:11:29,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-03 01:11:29,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-03 01:11:29,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-03 01:11:29,025 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-03 01:11:29,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-04-03 01:11:29,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-03 01:11:29,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-03 01:11:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-03 01:11:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-03 01:11:29,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-03 01:11:29,077 INFO L236 CfgBuilder]: Building ICFG [2023-04-03 01:11:29,080 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-03 01:11:29,221 INFO L277 CfgBuilder]: Performing block encoding [2023-04-03 01:11:29,230 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-03 01:11:29,231 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-03 01:11:29,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:11:29 BoogieIcfgContainer [2023-04-03 01:11:29,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-03 01:11:29,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-03 01:11:29,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-03 01:11:29,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-03 01:11:29,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.04 01:11:28" (1/3) ... [2023-04-03 01:11:29,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d9f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:11:29, skipping insertion in model container [2023-04-03 01:11:29,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.04 01:11:28" (2/3) ... [2023-04-03 01:11:29,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d9f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.04 01:11:29, skipping insertion in model container [2023-04-03 01:11:29,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.04 01:11:29" (3/3) ... [2023-04-03 01:11:29,259 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03.c [2023-04-03 01:11:29,271 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-03 01:11:29,271 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-03 01:11:29,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-03 01:11:29,310 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3d0795ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-03 01:11:29,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-03 01:11:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-03 01:11:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-03 01:11:29,320 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:29,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:29,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:29,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1664353218, now seen corresponding path program 1 times [2023-04-03 01:11:29,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:29,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812550277] [2023-04-03 01:11:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:11:29,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:29,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812550277] [2023-04-03 01:11:29,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812550277] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:11:29,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:11:29,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:11:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141499428] [2023-04-03 01:11:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:11:29,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:11:29,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:29,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:11:29,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:11:29,528 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-03 01:11:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:29,592 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2023-04-03 01:11:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:11:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2023-04-03 01:11:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:29,603 INFO L225 Difference]: With dead ends: 36 [2023-04-03 01:11:29,603 INFO L226 Difference]: Without dead ends: 22 [2023-04-03 01:11:29,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:11:29,617 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:29,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 65 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:11:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-04-03 01:11:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-04-03 01:11:29,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-03 01:11:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-03 01:11:29,659 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2023-04-03 01:11:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:29,659 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-03 01:11:29,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-03 01:11:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-03 01:11:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-04-03 01:11:29,660 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:29,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:29,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-03 01:11:29,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:29,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash 636937174, now seen corresponding path program 1 times [2023-04-03 01:11:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959920355] [2023-04-03 01:11:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-03 01:11:29,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959920355] [2023-04-03 01:11:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959920355] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-03 01:11:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-03 01:11:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-03 01:11:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133694420] [2023-04-03 01:11:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-03 01:11:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-03 01:11:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-03 01:11:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-03 01:11:29,729 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-03 01:11:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:29,767 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-04-03 01:11:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-03 01:11:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2023-04-03 01:11:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:29,769 INFO L225 Difference]: With dead ends: 28 [2023-04-03 01:11:29,769 INFO L226 Difference]: Without dead ends: 24 [2023-04-03 01:11:29,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-03 01:11:29,770 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:29,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-03 01:11:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-03 01:11:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-04-03 01:11:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-03 01:11:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-04-03 01:11:29,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2023-04-03 01:11:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:29,785 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-04-03 01:11:29,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-03 01:11:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-04-03 01:11:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-03 01:11:29,786 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:29,786 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-03 01:11:29,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:29,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1287007975, now seen corresponding path program 1 times [2023-04-03 01:11:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132545953] [2023-04-03 01:11:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:11:29,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:29,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132545953] [2023-04-03 01:11:29,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132545953] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:29,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460001664] [2023-04-03 01:11:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:29,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:29,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:29,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:29,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-03 01:11:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:29,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-03 01:11:30,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-03 01:11:30,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-03 01:11:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460001664] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1588293202] [2023-04-03 01:11:30,238 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:30,239 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:30,243 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:30,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2023-04-03 01:11:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719598524] [2023-04-03 01:11:30,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:30,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-03 01:11:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:30,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-03 01:11:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-04-03 01:11:30,253 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-03 01:11:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:30,375 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2023-04-03 01:11:30,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-03 01:11:30,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 27 [2023-04-03 01:11:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:30,378 INFO L225 Difference]: With dead ends: 46 [2023-04-03 01:11:30,378 INFO L226 Difference]: Without dead ends: 29 [2023-04-03 01:11:30,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:11:30,382 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:30,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-03 01:11:30,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-04-03 01:11:30,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2023-04-03 01:11:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2023-04-03 01:11:30,388 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 27 [2023-04-03 01:11:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:30,388 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2023-04-03 01:11:30,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2023-04-03 01:11:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2023-04-03 01:11:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-03 01:11:30,390 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:30,390 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:30,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-04-03 01:11:30,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:30,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:30,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash 15127051, now seen corresponding path program 1 times [2023-04-03 01:11:30,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:30,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358416237] [2023-04-03 01:11:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-04-03 01:11:30,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358416237] [2023-04-03 01:11:30,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358416237] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:30,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001345853] [2023-04-03 01:11:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:30,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:30,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-03 01:11:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:30,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:11:30,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 48 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-04-03 01:11:30,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-03 01:11:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001345853] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1565523229] [2023-04-03 01:11:31,265 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:31,265 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:31,265 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:31,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:31,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 14 [2023-04-03 01:11:31,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387167450] [2023-04-03 01:11:31,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:31,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-03 01:11:31,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-03 01:11:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-04-03 01:11:31,269 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-03 01:11:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:31,382 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2023-04-03 01:11:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-03 01:11:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 55 [2023-04-03 01:11:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:31,390 INFO L225 Difference]: With dead ends: 66 [2023-04-03 01:11:31,390 INFO L226 Difference]: Without dead ends: 60 [2023-04-03 01:11:31,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-04-03 01:11:31,393 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:31,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 78 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-03 01:11:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-04-03 01:11:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 11 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) [2023-04-03 01:11:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2023-04-03 01:11:31,414 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 55 [2023-04-03 01:11:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:31,414 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2023-04-03 01:11:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 9 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-03 01:11:31,415 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2023-04-03 01:11:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-04-03 01:11:31,419 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:31,420 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 13, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:31,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:31,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-03 01:11:31,625 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:31,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 94105297, now seen corresponding path program 2 times [2023-04-03 01:11:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:31,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803441733] [2023-04-03 01:11:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 52 proven. 327 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2023-04-03 01:11:31,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803441733] [2023-04-03 01:11:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803441733] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480298569] [2023-04-03 01:11:31,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:11:31,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:31,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:31,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:31,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-03 01:11:31,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-03 01:11:31,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:31,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-03 01:11:31,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 476 proven. 13 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2023-04-03 01:11:32,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 267 proven. 60 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2023-04-03 01:11:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480298569] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1979350928] [2023-04-03 01:11:32,652 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:32,653 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:32,653 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:32,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2023-04-03 01:11:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84772231] [2023-04-03 01:11:32,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-03 01:11:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:32,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-03 01:11:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-04-03 01:11:32,655 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2023-04-03 01:11:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:32,913 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2023-04-03 01:11:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-03 01:11:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) Word has length 135 [2023-04-03 01:11:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:32,916 INFO L225 Difference]: With dead ends: 114 [2023-04-03 01:11:32,916 INFO L226 Difference]: Without dead ends: 69 [2023-04-03 01:11:32,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 262 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2023-04-03 01:11:32,918 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 98 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:32,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 128 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-04-03 01:11:32,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2023-04-03 01:11:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 11 states have call successors, (11), 8 states have call predecessors, (11), 8 states have return successors, (24), 12 states have call predecessors, (24), 10 states have call successors, (24) [2023-04-03 01:11:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2023-04-03 01:11:32,924 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 135 [2023-04-03 01:11:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:32,925 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2023-04-03 01:11:32,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 19 states have internal predecessors, (63), 12 states have call successors, (18), 2 states have call predecessors, (18), 10 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2023-04-03 01:11:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2023-04-03 01:11:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-04-03 01:11:32,927 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:32,927 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:32,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-03 01:11:33,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:33,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:33,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:33,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2053642813, now seen corresponding path program 3 times [2023-04-03 01:11:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714073590] [2023-04-03 01:11:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2023-04-03 01:11:33,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:33,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714073590] [2023-04-03 01:11:33,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714073590] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:33,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572672135] [2023-04-03 01:11:33,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:11:33,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:33,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:33,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:33,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-03 01:11:33,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:11:33,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:33,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-03 01:11:33,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 843 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2023-04-03 01:11:33,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 891 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2023-04-03 01:11:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572672135] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1309151885] [2023-04-03 01:11:35,352 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:35,353 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:35,353 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:35,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:35,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 23] total 27 [2023-04-03 01:11:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411940317] [2023-04-03 01:11:35,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:35,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-03 01:11:35,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:35,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-03 01:11:35,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2023-04-03 01:11:35,356 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 21 states have call successors, (25), 1 states have call predecessors, (25), 13 states have return successors, (33), 13 states have call predecessors, (33), 21 states have call successors, (33) [2023-04-03 01:11:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:35,794 INFO L93 Difference]: Finished difference Result 138 states and 229 transitions. [2023-04-03 01:11:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-03 01:11:35,795 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 21 states have call successors, (25), 1 states have call predecessors, (25), 13 states have return successors, (33), 13 states have call predecessors, (33), 21 states have call successors, (33) Word has length 219 [2023-04-03 01:11:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:35,799 INFO L225 Difference]: With dead ends: 138 [2023-04-03 01:11:35,799 INFO L226 Difference]: Without dead ends: 86 [2023-04-03 01:11:35,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 416 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=564, Invalid=1692, Unknown=0, NotChecked=0, Total=2256 [2023-04-03 01:11:35,801 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 160 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:35,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 232 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-03 01:11:35,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-04-03 01:11:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2023-04-03 01:11:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 54 states have internal predecessors, (60), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2023-04-03 01:11:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2023-04-03 01:11:35,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 219 [2023-04-03 01:11:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:35,819 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2023-04-03 01:11:35,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.185185185185185) internal successors, (86), 27 states have internal predecessors, (86), 21 states have call successors, (25), 1 states have call predecessors, (25), 13 states have return successors, (33), 13 states have call predecessors, (33), 21 states have call successors, (33) [2023-04-03 01:11:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2023-04-03 01:11:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2023-04-03 01:11:35,822 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:35,823 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 46, 28, 28, 28, 28, 28, 28, 28, 18, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:35,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:36,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:36,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:36,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1916485854, now seen corresponding path program 4 times [2023-04-03 01:11:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624162835] [2023-04-03 01:11:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 229 proven. 1709 refuted. 0 times theorem prover too weak. 6993 trivial. 0 not checked. [2023-04-03 01:11:36,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624162835] [2023-04-03 01:11:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624162835] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177578348] [2023-04-03 01:11:36,545 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-03 01:11:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:36,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:36,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-03 01:11:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:36,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-03 01:11:36,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 229 proven. 1709 refuted. 0 times theorem prover too weak. 6993 trivial. 0 not checked. [2023-04-03 01:11:36,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8931 backedges. 229 proven. 1766 refuted. 0 times theorem prover too weak. 6936 trivial. 0 not checked. [2023-04-03 01:11:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177578348] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:38,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [685116661] [2023-04-03 01:11:38,456 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:38,456 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:38,457 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:38,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:38,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2023-04-03 01:11:38,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243116547] [2023-04-03 01:11:38,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:38,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-03 01:11:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-03 01:11:38,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2023-04-03 01:11:38,460 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2023-04-03 01:11:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:38,618 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2023-04-03 01:11:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-03 01:11:38,618 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) Word has length 396 [2023-04-03 01:11:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:38,622 INFO L225 Difference]: With dead ends: 98 [2023-04-03 01:11:38,622 INFO L226 Difference]: Without dead ends: 92 [2023-04-03 01:11:38,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 784 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2023-04-03 01:11:38,625 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 103 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:38,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 113 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:11:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-04-03 01:11:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-04-03 01:11:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 60 states have internal predecessors, (66), 17 states have call successors, (17), 13 states have call predecessors, (17), 11 states have return successors, (52), 18 states have call predecessors, (52), 16 states have call successors, (52) [2023-04-03 01:11:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2023-04-03 01:11:38,643 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 396 [2023-04-03 01:11:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:38,645 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2023-04-03 01:11:38,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 15 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2023-04-03 01:11:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2023-04-03 01:11:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2023-04-03 01:11:38,665 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:38,665 INFO L195 NwaCegarLoop]: trace histogram [167, 167, 135, 83, 83, 83, 83, 83, 83, 83, 52, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:38,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:38,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:38,874 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:38,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1251630707, now seen corresponding path program 5 times [2023-04-03 01:11:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157225584] [2023-04-03 01:11:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 78101 backedges. 2190 proven. 9477 refuted. 0 times theorem prover too weak. 66434 trivial. 0 not checked. [2023-04-03 01:11:40,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157225584] [2023-04-03 01:11:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157225584] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316194483] [2023-04-03 01:11:40,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-03 01:11:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:40,878 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:40,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-03 01:11:41,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2023-04-03 01:11:41,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:41,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-03 01:11:41,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 78101 backedges. 4644 proven. 7056 refuted. 0 times theorem prover too weak. 66401 trivial. 0 not checked. [2023-04-03 01:11:41,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:11:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 78101 backedges. 4644 proven. 7167 refuted. 0 times theorem prover too weak. 66290 trivial. 0 not checked. [2023-04-03 01:11:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316194483] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:11:46,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [767962538] [2023-04-03 01:11:46,131 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:11:46,131 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:11:46,132 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:11:46,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:11:46,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 40 [2023-04-03 01:11:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514089065] [2023-04-03 01:11:46,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:11:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-04-03 01:11:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:11:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-04-03 01:11:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2023-04-03 01:11:46,146 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 30 states have call successors, (40), 1 states have call predecessors, (40), 19 states have return successors, (56), 26 states have call predecessors, (56), 30 states have call successors, (56) [2023-04-03 01:11:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:11:47,281 INFO L93 Difference]: Finished difference Result 273 states and 617 transitions. [2023-04-03 01:11:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-04-03 01:11:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 30 states have call successors, (40), 1 states have call predecessors, (40), 19 states have return successors, (56), 26 states have call predecessors, (56), 30 states have call successors, (56) Word has length 1145 [2023-04-03 01:11:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:11:47,285 INFO L225 Difference]: With dead ends: 273 [2023-04-03 01:11:47,285 INFO L226 Difference]: Without dead ends: 190 [2023-04-03 01:11:47,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2367 GetRequests, 2268 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1758, Invalid=6074, Unknown=0, NotChecked=0, Total=7832 [2023-04-03 01:11:47,292 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 422 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-03 01:11:47,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 290 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-03 01:11:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-04-03 01:11:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 158. [2023-04-03 01:11:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 108 states have internal predecessors, (116), 33 states have call successors, (33), 28 states have call predecessors, (33), 12 states have return successors, (93), 21 states have call predecessors, (93), 32 states have call successors, (93) [2023-04-03 01:11:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2023-04-03 01:11:47,317 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 1145 [2023-04-03 01:11:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:11:47,318 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2023-04-03 01:11:47,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 30 states have call successors, (40), 1 states have call predecessors, (40), 19 states have return successors, (56), 26 states have call predecessors, (56), 30 states have call successors, (56) [2023-04-03 01:11:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2023-04-03 01:11:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2023-04-03 01:11:47,340 INFO L187 NwaCegarLoop]: Found error trace [2023-04-03 01:11:47,340 INFO L195 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-03 01:11:47,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-03 01:11:47,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:47,548 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-03 01:11:47,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-03 01:11:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 954469934, now seen corresponding path program 6 times [2023-04-03 01:11:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-03 01:11:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163483324] [2023-04-03 01:11:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-03 01:11:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-03 01:11:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-03 01:11:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 2756 proven. 10117 refuted. 0 times theorem prover too weak. 20223 trivial. 0 not checked. [2023-04-03 01:11:58,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-03 01:11:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163483324] [2023-04-03 01:11:58,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163483324] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-03 01:11:58,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118850632] [2023-04-03 01:11:58,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-03 01:11:58,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:11:58,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-03 01:11:58,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-03 01:11:58,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-03 01:11:58,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-03 01:11:58,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-03 01:11:58,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 220 conjunts are in the unsatisfiable core [2023-04-03 01:11:58,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-03 01:11:59,498 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-04-03 01:11:59,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-03 01:13:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2023-04-03 01:13:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118850632] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-03 01:13:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1782166911] [2023-04-03 01:13:17,193 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-04-03 01:13:17,193 INFO L166 IcfgInterpreter]: Building call graph [2023-04-03 01:13:17,193 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-03 01:13:17,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-03 01:13:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 41 [2023-04-03 01:13:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675947287] [2023-04-03 01:13:17,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-03 01:13:17,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-04-03 01:13:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-03 01:13:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-04-03 01:13:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2023-04-03 01:13:17,196 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 41 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (28), 28 states have call predecessors, (28), 9 states have call successors, (28) [2023-04-03 01:13:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-03 01:13:17,388 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2023-04-03 01:13:17,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-04-03 01:13:17,388 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (28), 28 states have call predecessors, (28), 9 states have call successors, (28) Word has length 750 [2023-04-03 01:13:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-03 01:13:17,389 INFO L225 Difference]: With dead ends: 165 [2023-04-03 01:13:17,389 INFO L226 Difference]: Without dead ends: 0 [2023-04-03 01:13:17,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1725 GetRequests, 1497 SyntacticMatches, 184 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=362, Invalid=1708, Unknown=0, NotChecked=0, Total=2070 [2023-04-03 01:13:17,391 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-03 01:13:17,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 313 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-03 01:13:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-03 01:13:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-03 01:13:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-03 01:13:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-03 01:13:17,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2023-04-03 01:13:17,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-03 01:13:17,392 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-03 01:13:17,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 22 states have internal predecessors, (50), 9 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (28), 28 states have call predecessors, (28), 9 states have call successors, (28) [2023-04-03 01:13:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-03 01:13:17,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-03 01:13:17,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-03 01:13:17,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-03 01:13:17,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-03 01:13:17,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-03 01:13:18,132 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-03 01:13:18,132 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L895 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: (and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (and (or (and (<= 2 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 4) .cse0) (and (<= 3 |fibonacci_#t~ret4|) .cse0) (< |fibonacci_#in~n| 4)) (or (and (< 1 fibonacci_~n) (= |fibonacci_#t~ret4| 1) .cse0) (< 3 |fibonacci_#in~n|)) (or (<= 21 |fibonacci_#t~ret4|) (and (<= |fibonacci_#in~n| 8) (<= 13 |fibonacci_#t~ret4|)) (and (<= 5 |fibonacci_#t~ret4|) (<= fibonacci_~n 6)) (< |fibonacci_#in~n| 6) (and (<= 8 |fibonacci_#t~ret4|) (<= |fibonacci_#in~n| 7))))) [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 24) the Hoare annotation is: true [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2023-04-03 01:13:18,133 INFO L902 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2023-04-03 01:13:18,133 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point L32-1(line 32) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 27 38) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 27 38) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 27 38) the Hoare annotation is: true [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-03 01:13:18,134 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-03 01:13:18,134 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-03 01:13:18,136 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2023-04-03 01:13:18,137 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-03 01:13:18,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.04 01:13:18 BoogieIcfgContainer [2023-04-03 01:13:18,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-03 01:13:18,141 INFO L158 Benchmark]: Toolchain (without parser) took 109373.81ms. Allocated memory was 203.4MB in the beginning and 879.8MB in the end (delta: 676.3MB). Free memory was 154.2MB in the beginning and 629.4MB in the end (delta: -475.2MB). Peak memory consumption was 202.1MB. Max. memory is 8.0GB. [2023-04-03 01:13:18,141 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-03 01:13:18,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 143.49ms. Allocated memory is still 203.4MB. Free memory was 154.2MB in the beginning and 144.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-03 01:13:18,142 INFO L158 Benchmark]: Boogie Preprocessor took 21.71ms. Allocated memory is still 203.4MB. Free memory was 144.2MB in the beginning and 142.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-03 01:13:18,142 INFO L158 Benchmark]: RCFGBuilder took 297.75ms. Allocated memory is still 203.4MB. Free memory was 142.5MB in the beginning and 131.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-03 01:13:18,142 INFO L158 Benchmark]: TraceAbstraction took 108887.10ms. Allocated memory was 203.4MB in the beginning and 879.8MB in the end (delta: 676.3MB). Free memory was 131.2MB in the beginning and 629.4MB in the end (delta: -498.1MB). Peak memory consumption was 179.0MB. Max. memory is 8.0GB. [2023-04-03 01:13:18,143 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 143.49ms. Allocated memory is still 203.4MB. Free memory was 154.2MB in the beginning and 144.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.71ms. Allocated memory is still 203.4MB. Free memory was 144.2MB in the beginning and 142.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 297.75ms. Allocated memory is still 203.4MB. Free memory was 142.5MB in the beginning and 131.6MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 108887.10ms. Allocated memory was 203.4MB in the beginning and 879.8MB in the end (delta: 676.3MB). Free memory was 131.2MB in the beginning and 629.4MB in the end (delta: -498.1MB). Peak memory consumption was 179.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 108.8s, OverallIterations: 9, TraceHistogramMax: 167, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 864 mSDsluCounter, 1354 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1117 mSDsCounter, 791 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1836 IncrementalHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 791 mSolverCounterUnsat, 237 mSDtfsCounter, 1836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5881 GetRequests, 5388 SyntacticMatches, 220 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8389 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=8, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 56 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 197 PreInvPairs, 327 NumberOfFragments, 77 HoareAnnotationTreeSize, 197 FomulaSimplifications, 2430 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3398 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 102.1s InterpolantComputationTime, 5483 NumberOfCodeBlocks, 4870 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 8187 ConstructedInterpolants, 0 QuantifiedInterpolants, 13103 SizeOfPredicates, 38 NumberOfNonLiveVariables, 4865 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 319289/371196 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-03 01:13:18,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...