/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 IntervalDomain -i ../sv-benchmarks/c/recursive-simple/fibo_2calls_20-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:02:27,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:02:27,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:02:27,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:02:27,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:02:27,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:02:27,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:02:27,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:02:27,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:02:27,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:02:27,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:02:27,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:02:27,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:02:27,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:02:27,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:02:27,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:02:27,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:02:27,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:02:27,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:02:27,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:02:27,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:02:27,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:02:27,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:02:27,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:02:27,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:02:27,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:02:27,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:02:27,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:02:27,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:02:27,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:02:27,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:02:27,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:02:27,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:02:27,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:02:27,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:02:27,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:02:27,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:02:27,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:02:27,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:02:27,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:02:27,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:02:27,469 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-01 00:02:27,501 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:02:27,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:02:27,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:02:27,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:02:27,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:02:27,502 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:02:27,502 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:02:27,502 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:02:27,502 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:02:27,502 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:02:27,503 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:02:27,503 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:02:27,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:02:27,504 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:02:27,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:02:27,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:02:27,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:02:27,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:02:27,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:02:27,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:02:27,507 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:02:27,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:02:27,508 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:02:27,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:02:27,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:02:27,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:02:27,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:27,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:02:27,508 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:02:27,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:02:27,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:02:27,509 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:02:27,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:02:27,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:02:27,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:02:27,510 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 -> IntervalDomain [2023-04-01 00:02:27,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:02:27,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:02:27,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:02:27,777 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:02:27,777 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:02:27,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_20-2.c [2023-04-01 00:02:28,916 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:02:29,133 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:02:29,134 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_20-2.c [2023-04-01 00:02:29,139 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d153e86/5b64c9b885b14a50ab1b867a1566cabc/FLAGab2facd96 [2023-04-01 00:02:29,154 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69d153e86/5b64c9b885b14a50ab1b867a1566cabc [2023-04-01 00:02:29,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:02:29,161 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:02:29,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:29,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:02:29,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:02:29,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51984916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29, skipping insertion in model container [2023-04-01 00:02:29,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:02:29,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:02:29,297 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-simple/fibo_2calls_20-2.c[951,964] [2023-04-01 00:02:29,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:29,309 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:02:29,320 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-simple/fibo_2calls_20-2.c[951,964] [2023-04-01 00:02:29,320 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:02:29,332 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:02:29,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29 WrapperNode [2023-04-01 00:02:29,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:02:29,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:02:29,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:02:29,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:02:29,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,350 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:02:29,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:02:29,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:02:29,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:02:29,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (1/1) ... [2023-04-01 00:02:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:02:29,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:29,381 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-01 00:02:29,385 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-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-04-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-04-01 00:02:29,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:02:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:02:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:02:29,411 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:02:29,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:02:29,468 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:02:29,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:02:29,617 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:02:29,636 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:02:29,651 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:02:29,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:29 BoogieIcfgContainer [2023-04-01 00:02:29,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:02:29,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:02:29,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:02:29,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:02:29,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:02:29" (1/3) ... [2023-04-01 00:02:29,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294063df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:29, skipping insertion in model container [2023-04-01 00:02:29,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:02:29" (2/3) ... [2023-04-01 00:02:29,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294063df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:02:29, skipping insertion in model container [2023-04-01 00:02:29,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:02:29" (3/3) ... [2023-04-01 00:02:29,660 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_20-2.c [2023-04-01 00:02:29,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:02:29,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:02:29,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:02:29,749 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;@5f5df5c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:02:29,749 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:02:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 00:02:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 00:02:29,758 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:29,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:29,759 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:29,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1638346757, now seen corresponding path program 1 times [2023-04-01 00:02:29,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:29,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259120160] [2023-04-01 00:02:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:30,049 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-01 00:02:30,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259120160] [2023-04-01 00:02:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259120160] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564847875] [2023-04-01 00:02:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:30,102 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:30,208 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-04-01 00:02:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:30,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-01 00:02:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:30,217 INFO L225 Difference]: With dead ends: 42 [2023-04-01 00:02:30,217 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 00:02:30,224 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-01 00:02:30,229 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:30,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 89 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:02:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 00:02:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 00:02:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:02:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:30,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2023-04-01 00:02:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:30,271 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:30,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 00:02:30,274 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:30,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:30,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:02:30,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:30,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:30,277 INFO L85 PathProgramCache]: Analyzing trace with hash -40226507, now seen corresponding path program 1 times [2023-04-01 00:02:30,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:30,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139175995] [2023-04-01 00:02:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:30,387 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-01 00:02:30,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139175995] [2023-04-01 00:02:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139175995] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:02:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:02:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488912558] [2023-04-01 00:02:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:30,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:02:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:02:30,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:02:30,392 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:30,454 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2023-04-01 00:02:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:02:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2023-04-01 00:02:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:30,455 INFO L225 Difference]: With dead ends: 36 [2023-04-01 00:02:30,455 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 00:02:30,456 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-01 00:02:30,457 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:30,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:02:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 00:02:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-04-01 00:02:30,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-04-01 00:02:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-04-01 00:02:30,469 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2023-04-01 00:02:30,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:30,470 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-04-01 00:02:30,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 00:02:30,470 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-04-01 00:02:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 00:02:30,471 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:30,471 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:02:30,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:30,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1791010960, now seen corresponding path program 1 times [2023-04-01 00:02:30,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:30,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776684367] [2023-04-01 00:02:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:30,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776684367] [2023-04-01 00:02:30,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776684367] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:30,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790253395] [2023-04-01 00:02:30,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:30,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:30,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:30,649 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-01 00:02:30,653 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-01 00:02:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:30,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:02:30,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:30,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:02:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790253395] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:31,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [57251064] [2023-04-01 00:02:31,070 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-04-01 00:02:31,071 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:31,074 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:02:31,078 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:02:31,078 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:02:31,142 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 8 for LOIs [2023-04-01 00:02:31,194 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 11 for LOIs [2023-04-01 00:02:31,210 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 11 for LOIs [2023-04-01 00:02:31,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 00:02:31,219 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:02:31,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [57251064] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:02:31,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:31,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 7, 7] total 20 [2023-04-01 00:02:31,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433106655] [2023-04-01 00:02:31,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:02:31,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 00:02:31,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:31,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 00:02:31,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:31,401 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:32,048 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-04-01 00:02:32,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:02:32,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-04-01 00:02:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:32,054 INFO L225 Difference]: With dead ends: 72 [2023-04-01 00:02:32,054 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 00:02:32,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2023-04-01 00:02:32,060 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:32,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 6 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 00:02:32,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2023-04-01 00:02:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 00:02:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-04-01 00:02:32,090 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2023-04-01 00:02:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:32,090 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-04-01 00:02:32,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 00:02:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2023-04-01 00:02:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-04-01 00:02:32,094 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:32,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:32,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:32,300 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-01 00:02:32,301 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:32,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:32,301 INFO L85 PathProgramCache]: Analyzing trace with hash 997297373, now seen corresponding path program 1 times [2023-04-01 00:02:32,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895718043] [2023-04-01 00:02:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:02:32,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895718043] [2023-04-01 00:02:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895718043] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580120745] [2023-04-01 00:02:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:32,386 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-01 00:02:32,389 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-01 00:02:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:32,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:32,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:02:32,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:02:32,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580120745] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1046892242] [2023-04-01 00:02:32,843 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:32,843 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:32,844 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-01 00:02:32,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:32,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2023-04-01 00:02:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555460597] [2023-04-01 00:02:32,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:32,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 00:02:32,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 00:02:32,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-04-01 00:02:32,855 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:33,055 INFO L93 Difference]: Finished difference Result 89 states and 125 transitions. [2023-04-01 00:02:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 00:02:33,056 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) Word has length 39 [2023-04-01 00:02:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:33,060 INFO L225 Difference]: With dead ends: 89 [2023-04-01 00:02:33,061 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 00:02:33,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:33,070 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:33,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:33,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 00:02:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2023-04-01 00:02:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 00:02:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-04-01 00:02:33,094 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 39 [2023-04-01 00:02:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-04-01 00:02:33,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (15), 1 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-04-01 00:02:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:02:33,096 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:33,096 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:33,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-01 00:02:33,302 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-01 00:02:33,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:33,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1525437707, now seen corresponding path program 1 times [2023-04-01 00:02:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320944508] [2023-04-01 00:02:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:02:33,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320944508] [2023-04-01 00:02:33,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320944508] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:33,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999225132] [2023-04-01 00:02:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:33,421 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-01 00:02:33,435 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-01 00:02:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:33,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:33,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:02:33,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 00:02:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999225132] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [618038594] [2023-04-01 00:02:33,913 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:33,913 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:33,913 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-01 00:02:33,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2023-04-01 00:02:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566222180] [2023-04-01 00:02:33,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:33,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:33,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:33,918 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:34,317 INFO L93 Difference]: Finished difference Result 125 states and 207 transitions. [2023-04-01 00:02:34,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 00:02:34,317 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) Word has length 40 [2023-04-01 00:02:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:34,319 INFO L225 Difference]: With dead ends: 125 [2023-04-01 00:02:34,319 INFO L226 Difference]: Without dead ends: 81 [2023-04-01 00:02:34,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:02:34,322 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 51 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:34,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 247 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-04-01 00:02:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2023-04-01 00:02:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2023-04-01 00:02:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-04-01 00:02:34,345 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 40 [2023-04-01 00:02:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:34,346 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-04-01 00:02:34,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (14), 7 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:02:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-04-01 00:02:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-04-01 00:02:34,348 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:34,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:34,354 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-01 00:02:34,554 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-01 00:02:34,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:34,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash -684158310, now seen corresponding path program 1 times [2023-04-01 00:02:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933079308] [2023-04-01 00:02:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-04-01 00:02:34,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933079308] [2023-04-01 00:02:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933079308] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726586787] [2023-04-01 00:02:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:34,657 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-01 00:02:34,665 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-01 00:02:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:34,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 00:02:34,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 00:02:34,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 00:02:35,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726586787] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:35,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1265236569] [2023-04-01 00:02:35,240 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:35,240 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:35,241 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-01 00:02:35,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2023-04-01 00:02:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466675053] [2023-04-01 00:02:35,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 00:02:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 00:02:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:02:35,244 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:35,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:35,434 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2023-04-01 00:02:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 00:02:35,435 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 54 [2023-04-01 00:02:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:35,441 INFO L225 Difference]: With dead ends: 123 [2023-04-01 00:02:35,442 INFO L226 Difference]: Without dead ends: 101 [2023-04-01 00:02:35,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:02:35,457 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 52 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:35,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 117 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-04-01 00:02:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2023-04-01 00:02:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 12 states have return successors, (40), 18 states have call predecessors, (40), 15 states have call successors, (40) [2023-04-01 00:02:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2023-04-01 00:02:35,484 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 54 [2023-04-01 00:02:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:35,484 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2023-04-01 00:02:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:02:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2023-04-01 00:02:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-04-01 00:02:35,487 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:35,487 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:35,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-04-01 00:02:35,692 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-01 00:02:35,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:35,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1187443411, now seen corresponding path program 1 times [2023-04-01 00:02:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:35,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706507393] [2023-04-01 00:02:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-04-01 00:02:35,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:35,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706507393] [2023-04-01 00:02:35,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706507393] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:35,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106680079] [2023-04-01 00:02:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:35,864 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-01 00:02:35,865 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-01 00:02:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:35,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:35,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-04-01 00:02:36,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 102 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-04-01 00:02:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106680079] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:36,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1266540854] [2023-04-01 00:02:36,877 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:36,877 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:36,877 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-01 00:02:36,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:36,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2023-04-01 00:02:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576643161] [2023-04-01 00:02:36,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:36,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:02:36,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:02:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2023-04-01 00:02:36,880 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-01 00:02:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:37,548 INFO L93 Difference]: Finished difference Result 208 states and 415 transitions. [2023-04-01 00:02:37,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 00:02:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) Word has length 96 [2023-04-01 00:02:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:37,551 INFO L225 Difference]: With dead ends: 208 [2023-04-01 00:02:37,551 INFO L226 Difference]: Without dead ends: 119 [2023-04-01 00:02:37,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 176 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 00:02:37,553 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 79 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:37,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-04-01 00:02:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2023-04-01 00:02:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 67 states have internal predecessors, (76), 21 states have call successors, (21), 10 states have call predecessors, (21), 15 states have return successors, (51), 24 states have call predecessors, (51), 20 states have call successors, (51) [2023-04-01 00:02:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 148 transitions. [2023-04-01 00:02:37,573 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 148 transitions. Word has length 96 [2023-04-01 00:02:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:37,574 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 148 transitions. [2023-04-01 00:02:37,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.619047619047619) internal successors, (76), 23 states have internal predecessors, (76), 18 states have call successors, (25), 1 states have call predecessors, (25), 9 states have return successors, (28), 10 states have call predecessors, (28), 18 states have call successors, (28) [2023-04-01 00:02:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 148 transitions. [2023-04-01 00:02:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2023-04-01 00:02:37,580 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:37,580 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 10, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:37,594 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-01 00:02:37,787 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-01 00:02:37,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:37,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1368434034, now seen corresponding path program 2 times [2023-04-01 00:02:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999368564] [2023-04-01 00:02:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 49 proven. 168 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-04-01 00:02:37,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999368564] [2023-04-01 00:02:37,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999368564] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:37,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937572189] [2023-04-01 00:02:37,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:37,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:37,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:37,931 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-01 00:02:37,957 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-01 00:02:38,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:38,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:38,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:38,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 38 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2023-04-01 00:02:38,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 293 proven. 39 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2023-04-01 00:02:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937572189] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:39,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1606272965] [2023-04-01 00:02:39,010 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:39,010 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:39,010 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-01 00:02:39,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:39,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 20 [2023-04-01 00:02:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636061195] [2023-04-01 00:02:39,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:39,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 00:02:39,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 00:02:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:39,014 INFO L87 Difference]: Start difference. First operand 102 states and 148 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-01 00:02:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:39,483 INFO L93 Difference]: Finished difference Result 230 states and 413 transitions. [2023-04-01 00:02:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:02:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 188 [2023-04-01 00:02:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:39,486 INFO L225 Difference]: With dead ends: 230 [2023-04-01 00:02:39,486 INFO L226 Difference]: Without dead ends: 128 [2023-04-01 00:02:39,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 358 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 00:02:39,488 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:39,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 00:02:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-04-01 00:02:39,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2023-04-01 00:02:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.178082191780822) internal successors, (86), 76 states have internal predecessors, (86), 24 states have call successors, (24), 11 states have call predecessors, (24), 17 states have return successors, (56), 27 states have call predecessors, (56), 23 states have call successors, (56) [2023-04-01 00:02:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2023-04-01 00:02:39,507 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 188 [2023-04-01 00:02:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:39,508 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2023-04-01 00:02:39,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 20 states have internal predecessors, (72), 12 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) [2023-04-01 00:02:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2023-04-01 00:02:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-04-01 00:02:39,510 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:39,510 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:39,519 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-01 00:02:39,719 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-01 00:02:39,720 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:39,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash -768180307, now seen corresponding path program 3 times [2023-04-01 00:02:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481793367] [2023-04-01 00:02:39,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 37 proven. 111 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-04-01 00:02:39,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481793367] [2023-04-01 00:02:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481793367] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531521269] [2023-04-01 00:02:39,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:39,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:39,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:39,909 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-01 00:02:39,933 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-01 00:02:40,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:40,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:40,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 00:02:40,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 181 proven. 6 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-04-01 00:02:40,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 52 proven. 95 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2023-04-01 00:02:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531521269] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1114839006] [2023-04-01 00:02:40,594 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:40,594 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:40,594 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-01 00:02:40,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-04-01 00:02:40,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294332321] [2023-04-01 00:02:40,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 00:02:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 00:02:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2023-04-01 00:02:40,601 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 18 states have internal predecessors, (74), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2023-04-01 00:02:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:41,004 INFO L93 Difference]: Finished difference Result 248 states and 388 transitions. [2023-04-01 00:02:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 00:02:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 18 states have internal predecessors, (74), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) Word has length 122 [2023-04-01 00:02:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:41,006 INFO L225 Difference]: With dead ends: 248 [2023-04-01 00:02:41,006 INFO L226 Difference]: Without dead ends: 147 [2023-04-01 00:02:41,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 237 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2023-04-01 00:02:41,008 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 90 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:41,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 202 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 00:02:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-04-01 00:02:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 110. [2023-04-01 00:02:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 24 states have call successors, (24), 11 states have call predecessors, (24), 15 states have return successors, (51), 26 states have call predecessors, (51), 23 states have call successors, (51) [2023-04-01 00:02:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-04-01 00:02:41,026 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 122 [2023-04-01 00:02:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:41,027 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-04-01 00:02:41,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.352941176470588) internal successors, (74), 18 states have internal predecessors, (74), 12 states have call successors, (24), 2 states have call predecessors, (24), 9 states have return successors, (28), 9 states have call predecessors, (28), 12 states have call successors, (28) [2023-04-01 00:02:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-04-01 00:02:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-04-01 00:02:41,031 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:41,031 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:41,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 00:02:41,239 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-01 00:02:41,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:41,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1654587886, now seen corresponding path program 1 times [2023-04-01 00:02:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148387386] [2023-04-01 00:02:41,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:41,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 67 proven. 171 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2023-04-01 00:02:41,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148387386] [2023-04-01 00:02:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148387386] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490620121] [2023-04-01 00:02:41,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:41,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:41,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:41,477 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:41,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 00:02:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:41,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:02:41,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2023-04-01 00:02:41,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 266 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2023-04-01 00:02:42,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490620121] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:42,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1628984326] [2023-04-01 00:02:42,950 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:42,950 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:42,950 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-01 00:02:42,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2023-04-01 00:02:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802893722] [2023-04-01 00:02:42,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:42,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:02:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:02:42,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:02:42,954 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 25 states have internal predecessors, (82), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:43,663 INFO L93 Difference]: Finished difference Result 265 states and 468 transitions. [2023-04-01 00:02:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-04-01 00:02:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 25 states have internal predecessors, (82), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) Word has length 164 [2023-04-01 00:02:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:43,666 INFO L225 Difference]: With dead ends: 265 [2023-04-01 00:02:43,666 INFO L226 Difference]: Without dead ends: 139 [2023-04-01 00:02:43,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 310 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 00:02:43,668 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 105 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:43,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 360 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-04-01 00:02:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-04-01 00:02:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 79 states have internal predecessors, (93), 25 states have call successors, (25), 13 states have call predecessors, (25), 16 states have return successors, (57), 26 states have call predecessors, (57), 24 states have call successors, (57) [2023-04-01 00:02:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2023-04-01 00:02:43,690 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 164 [2023-04-01 00:02:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:43,690 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2023-04-01 00:02:43,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 25 states have internal predecessors, (82), 20 states have call successors, (28), 1 states have call predecessors, (28), 10 states have return successors, (33), 11 states have call predecessors, (33), 20 states have call successors, (33) [2023-04-01 00:02:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2023-04-01 00:02:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2023-04-01 00:02:43,695 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:43,696 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 26, 26, 22, 21, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 8, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:43,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:43,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 00:02:43,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:43,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 69617426, now seen corresponding path program 4 times [2023-04-01 00:02:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033540250] [2023-04-01 00:02:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 113 proven. 807 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2023-04-01 00:02:44,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033540250] [2023-04-01 00:02:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033540250] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653395] [2023-04-01 00:02:44,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:44,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:44,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:44,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 00:02:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:44,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 00:02:44,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:44,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 113 proven. 807 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2023-04-01 00:02:44,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 113 proven. 831 refuted. 0 times theorem prover too weak. 3097 trivial. 0 not checked. [2023-04-01 00:02:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653395] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [252777993] [2023-04-01 00:02:46,459 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:46,459 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:46,459 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-01 00:02:46,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:46,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 20 [2023-04-01 00:02:46,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301041181] [2023-04-01 00:02:46,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:46,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 00:02:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 00:02:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:02:46,462 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 20 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 20 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (25), 8 states have call predecessors, (25), 17 states have call successors, (25) [2023-04-01 00:02:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:46,693 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2023-04-01 00:02:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 00:02:46,694 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 20 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (25), 8 states have call predecessors, (25), 17 states have call successors, (25) Word has length 380 [2023-04-01 00:02:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:46,697 INFO L225 Difference]: With dead ends: 146 [2023-04-01 00:02:46,697 INFO L226 Difference]: Without dead ends: 132 [2023-04-01 00:02:46,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 751 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-04-01 00:02:46,698 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:46,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:02:46,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-04-01 00:02:46,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2023-04-01 00:02:46,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 81 states have internal predecessors, (95), 25 states have call successors, (25), 13 states have call predecessors, (25), 17 states have return successors, (58), 27 states have call predecessors, (58), 24 states have call successors, (58) [2023-04-01 00:02:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2023-04-01 00:02:46,716 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 380 [2023-04-01 00:02:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:46,717 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2023-04-01 00:02:46,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 20 states have internal predecessors, (69), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (25), 8 states have call predecessors, (25), 17 states have call successors, (25) [2023-04-01 00:02:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2023-04-01 00:02:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2023-04-01 00:02:46,721 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:46,721 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 25, 25, 22, 20, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:46,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:46,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:46,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:46,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1490875133, now seen corresponding path program 5 times [2023-04-01 00:02:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:46,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097537250] [2023-04-01 00:02:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3761 backedges. 199 proven. 568 refuted. 0 times theorem prover too weak. 2994 trivial. 0 not checked. [2023-04-01 00:02:47,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097537250] [2023-04-01 00:02:47,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097537250] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:47,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753934593] [2023-04-01 00:02:47,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:02:47,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:47,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:47,369 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:47,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 00:02:47,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 00:02:47,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:47,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 00:02:47,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3761 backedges. 705 proven. 33 refuted. 0 times theorem prover too weak. 3023 trivial. 0 not checked. [2023-04-01 00:02:47,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3761 backedges. 705 proven. 35 refuted. 0 times theorem prover too weak. 3021 trivial. 0 not checked. [2023-04-01 00:02:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753934593] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:48,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [545624454] [2023-04-01 00:02:48,785 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:48,785 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:48,785 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-01 00:02:48,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:48,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 22 [2023-04-01 00:02:48,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473427624] [2023-04-01 00:02:48,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:48,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-04-01 00:02:48,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-04-01 00:02:48,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-04-01 00:02:48,789 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 15 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2023-04-01 00:02:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:49,441 INFO L93 Difference]: Finished difference Result 275 states and 466 transitions. [2023-04-01 00:02:49,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-04-01 00:02:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 15 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) Word has length 367 [2023-04-01 00:02:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:49,443 INFO L225 Difference]: With dead ends: 275 [2023-04-01 00:02:49,444 INFO L226 Difference]: Without dead ends: 167 [2023-04-01 00:02:49,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 722 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 00:02:49,446 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 89 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:49,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 297 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:02:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-04-01 00:02:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 152. [2023-04-01 00:02:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 101 states have internal predecessors, (118), 31 states have call successors, (31), 19 states have call predecessors, (31), 19 states have return successors, (89), 31 states have call predecessors, (89), 30 states have call successors, (89) [2023-04-01 00:02:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2023-04-01 00:02:49,471 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 367 [2023-04-01 00:02:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:49,472 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2023-04-01 00:02:49,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.8095238095238093) internal successors, (80), 22 states have internal predecessors, (80), 15 states have call successors, (24), 1 states have call predecessors, (24), 11 states have return successors, (28), 13 states have call predecessors, (28), 15 states have call successors, (28) [2023-04-01 00:02:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2023-04-01 00:02:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2023-04-01 00:02:49,484 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:49,484 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 40, 40, 38, 35, 25, 25, 25, 25, 25, 25, 25, 20, 20, 20, 20, 20, 20, 20, 18, 13, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:49,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:49,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 00:02:49,691 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:49,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash -796736894, now seen corresponding path program 6 times [2023-04-01 00:02:49,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:49,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755018310] [2023-04-01 00:02:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:49,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11478 backedges. 241 proven. 1586 refuted. 0 times theorem prover too weak. 9651 trivial. 0 not checked. [2023-04-01 00:02:50,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755018310] [2023-04-01 00:02:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755018310] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:50,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497699397] [2023-04-01 00:02:50,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:02:50,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:50,535 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:50,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 00:02:50,759 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:02:50,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:02:50,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:02:50,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11478 backedges. 5531 proven. 409 refuted. 0 times theorem prover too weak. 5538 trivial. 0 not checked. [2023-04-01 00:02:50,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11478 backedges. 458 proven. 2144 refuted. 0 times theorem prover too weak. 8876 trivial. 0 not checked. [2023-04-01 00:02:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497699397] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [151593846] [2023-04-01 00:02:54,205 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:54,205 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:54,205 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-01 00:02:54,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 23] total 31 [2023-04-01 00:02:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489937877] [2023-04-01 00:02:54,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:54,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 00:02:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:54,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 00:02:54,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2023-04-01 00:02:54,209 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 27 states have call successors, (38), 2 states have call predecessors, (38), 15 states have return successors, (47), 14 states have call predecessors, (47), 27 states have call successors, (47) [2023-04-01 00:02:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:02:55,374 INFO L93 Difference]: Finished difference Result 388 states and 791 transitions. [2023-04-01 00:02:55,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-04-01 00:02:55,375 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 27 states have call successors, (38), 2 states have call predecessors, (38), 15 states have return successors, (47), 14 states have call predecessors, (47), 27 states have call successors, (47) Word has length 626 [2023-04-01 00:02:55,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:02:55,378 INFO L225 Difference]: With dead ends: 388 [2023-04-01 00:02:55,379 INFO L226 Difference]: Without dead ends: 234 [2023-04-01 00:02:55,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1302 GetRequests, 1230 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=3299, Unknown=0, NotChecked=0, Total=3906 [2023-04-01 00:02:55,382 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 164 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 00:02:55,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 418 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 00:02:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-04-01 00:02:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 203. [2023-04-01 00:02:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 141 states have (on average 1.1560283687943262) internal successors, (163), 135 states have internal predecessors, (163), 41 states have call successors, (41), 33 states have call predecessors, (41), 20 states have return successors, (129), 34 states have call predecessors, (129), 40 states have call successors, (129) [2023-04-01 00:02:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 333 transitions. [2023-04-01 00:02:55,422 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 333 transitions. Word has length 626 [2023-04-01 00:02:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:02:55,422 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 333 transitions. [2023-04-01 00:02:55,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 27 states have call successors, (38), 2 states have call predecessors, (38), 15 states have return successors, (47), 14 states have call predecessors, (47), 27 states have call successors, (47) [2023-04-01 00:02:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 333 transitions. [2023-04-01 00:02:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2023-04-01 00:02:55,427 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:02:55,427 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 30, 30, 26, 24, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 10, 9, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:02:55,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 00:02:55,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 00:02:55,635 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:02:55,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:02:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1353342202, now seen corresponding path program 7 times [2023-04-01 00:02:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:02:55,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376346311] [2023-04-01 00:02:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:02:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:02:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5353 backedges. 645 proven. 675 refuted. 0 times theorem prover too weak. 4033 trivial. 0 not checked. [2023-04-01 00:02:56,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:02:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376346311] [2023-04-01 00:02:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376346311] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:02:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955284975] [2023-04-01 00:02:56,257 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:02:56,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:02:56,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:02:56,261 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:02:56,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 00:02:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:02:56,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 00:02:56,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:02:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5353 backedges. 195 proven. 1156 refuted. 0 times theorem prover too weak. 4002 trivial. 0 not checked. [2023-04-01 00:02:56,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:02:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5353 backedges. 195 proven. 1200 refuted. 0 times theorem prover too weak. 3958 trivial. 0 not checked. [2023-04-01 00:02:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955284975] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:02:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231532183] [2023-04-01 00:02:59,729 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:02:59,730 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:02:59,730 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-01 00:02:59,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:02:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 21] total 37 [2023-04-01 00:02:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107596704] [2023-04-01 00:02:59,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:02:59,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-04-01 00:02:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:02:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-04-01 00:02:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 00:02:59,735 INFO L87 Difference]: Start difference. First operand 203 states and 333 transitions. Second operand has 37 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 37 states have internal predecessors, (115), 28 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (48), 21 states have call predecessors, (48), 28 states have call successors, (48) [2023-04-01 00:03:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:03:00,895 INFO L93 Difference]: Finished difference Result 511 states and 966 transitions. [2023-04-01 00:03:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-04-01 00:03:00,896 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 37 states have internal predecessors, (115), 28 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (48), 21 states have call predecessors, (48), 28 states have call successors, (48) Word has length 435 [2023-04-01 00:03:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:03:00,902 INFO L225 Difference]: With dead ends: 511 [2023-04-01 00:03:00,902 INFO L226 Difference]: Without dead ends: 304 [2023-04-01 00:03:00,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 846 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=715, Invalid=4397, Unknown=0, NotChecked=0, Total=5112 [2023-04-01 00:03:00,907 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 192 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:03:00,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 446 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:03:00,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-04-01 00:03:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 247. [2023-04-01 00:03:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.1162790697674418) internal successors, (192), 165 states have internal predecessors, (192), 51 states have call successors, (51), 39 states have call predecessors, (51), 23 states have return successors, (143), 42 states have call predecessors, (143), 50 states have call successors, (143) [2023-04-01 00:03:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 386 transitions. [2023-04-01 00:03:00,944 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 386 transitions. Word has length 435 [2023-04-01 00:03:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:03:00,947 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 386 transitions. [2023-04-01 00:03:00,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.2857142857142856) internal successors, (115), 37 states have internal predecessors, (115), 28 states have call successors, (38), 1 states have call predecessors, (38), 18 states have return successors, (48), 21 states have call predecessors, (48), 28 states have call successors, (48) [2023-04-01 00:03:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 386 transitions. [2023-04-01 00:03:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2023-04-01 00:03:00,958 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:03:00,959 INFO L195 NwaCegarLoop]: trace histogram [93, 93, 84, 84, 74, 68, 46, 46, 46, 46, 46, 46, 46, 42, 42, 42, 42, 42, 42, 42, 32, 22, 19, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:03:00,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-04-01 00:03:01,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 00:03:01,167 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:03:01,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:03:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1378726245, now seen corresponding path program 8 times [2023-04-01 00:03:01,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:03:01,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860885600] [2023-04-01 00:03:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:03:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:03:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 43619 backedges. 1129 proven. 3235 refuted. 0 times theorem prover too weak. 39255 trivial. 0 not checked. [2023-04-01 00:03:03,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:03:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860885600] [2023-04-01 00:03:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860885600] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:03:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991885423] [2023-04-01 00:03:03,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:03:03,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:03,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:03:03,029 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:03:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 00:03:03,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-04-01 00:03:03,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:03:03,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:03:03,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:03:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43619 backedges. 7465 proven. 94 refuted. 0 times theorem prover too weak. 36060 trivial. 0 not checked. [2023-04-01 00:03:03,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:03:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 43619 backedges. 3348 proven. 260 refuted. 0 times theorem prover too weak. 40011 trivial. 0 not checked. [2023-04-01 00:03:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991885423] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:03:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1848170503] [2023-04-01 00:03:06,849 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:03:06,849 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:03:06,849 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-01 00:03:06,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:03:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 15] total 31 [2023-04-01 00:03:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287766897] [2023-04-01 00:03:06,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:03:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 00:03:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:03:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 00:03:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2023-04-01 00:03:06,855 INFO L87 Difference]: Start difference. First operand 247 states and 386 transitions. Second operand has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 31 states have internal predecessors, (110), 17 states have call successors, (35), 2 states have call predecessors, (35), 16 states have return successors, (45), 22 states have call predecessors, (45), 17 states have call successors, (45) [2023-04-01 00:03:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:03:07,777 INFO L93 Difference]: Finished difference Result 621 states and 1184 transitions. [2023-04-01 00:03:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-04-01 00:03:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 31 states have internal predecessors, (110), 17 states have call successors, (35), 2 states have call predecessors, (35), 16 states have return successors, (45), 22 states have call predecessors, (45), 17 states have call successors, (45) Word has length 1211 [2023-04-01 00:03:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:03:07,783 INFO L225 Difference]: With dead ends: 621 [2023-04-01 00:03:07,783 INFO L226 Difference]: Without dead ends: 356 [2023-04-01 00:03:07,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2468 GetRequests, 2406 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2023-04-01 00:03:07,789 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 124 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:03:07,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 450 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:03:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-04-01 00:03:07,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 308. [2023-04-01 00:03:07,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 218 states have (on average 1.091743119266055) internal successors, (238), 208 states have internal predecessors, (238), 63 states have call successors, (63), 52 states have call predecessors, (63), 26 states have return successors, (189), 47 states have call predecessors, (189), 62 states have call successors, (189) [2023-04-01 00:03:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 490 transitions. [2023-04-01 00:03:07,834 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 490 transitions. Word has length 1211 [2023-04-01 00:03:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:03:07,835 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 490 transitions. [2023-04-01 00:03:07,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5483870967741935) internal successors, (110), 31 states have internal predecessors, (110), 17 states have call successors, (35), 2 states have call predecessors, (35), 16 states have return successors, (45), 22 states have call predecessors, (45), 17 states have call successors, (45) [2023-04-01 00:03:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 490 transitions. [2023-04-01 00:03:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2023-04-01 00:03:07,850 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:03:07,850 INFO L195 NwaCegarLoop]: trace histogram [102, 102, 99, 99, 81, 81, 51, 51, 51, 51, 51, 51, 51, 49, 49, 49, 49, 49, 49, 49, 32, 30, 21, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:03:07,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 00:03:08,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 00:03:08,058 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:03:08,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:03:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash -891011467, now seen corresponding path program 9 times [2023-04-01 00:03:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:03:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083317860] [2023-04-01 00:03:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:03:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:03:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 56292 backedges. 770 proven. 3517 refuted. 0 times theorem prover too weak. 52005 trivial. 0 not checked. [2023-04-01 00:03:09,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:03:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083317860] [2023-04-01 00:03:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083317860] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:03:09,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216680515] [2023-04-01 00:03:09,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 00:03:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:03:09,802 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:03:09,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 00:03:10,272 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 00:03:10,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:03:10,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 2452 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 00:03:10,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:03:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 56292 backedges. 11561 proven. 176 refuted. 0 times theorem prover too weak. 44555 trivial. 0 not checked. [2023-04-01 00:03:10,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:03:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 56292 backedges. 836 proven. 4912 refuted. 0 times theorem prover too weak. 50544 trivial. 0 not checked. [2023-04-01 00:03:15,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216680515] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:03:15,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1425176] [2023-04-01 00:03:15,061 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-04-01 00:03:15,061 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:03:15,062 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-01 00:03:15,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:03:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 19] total 29 [2023-04-01 00:03:15,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323279861] [2023-04-01 00:03:15,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:03:15,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 00:03:15,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:03:15,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 00:03:15,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:03:15,067 INFO L87 Difference]: Start difference. First operand 308 states and 490 transitions. Second operand has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (45), 15 states have call predecessors, (45), 24 states have call successors, (45) [2023-04-01 00:03:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:03:16,029 INFO L93 Difference]: Finished difference Result 629 states and 1040 transitions. [2023-04-01 00:03:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-04-01 00:03:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (45), 15 states have call predecessors, (45), 24 states have call successors, (45) Word has length 1375 [2023-04-01 00:03:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:03:16,034 INFO L225 Difference]: With dead ends: 629 [2023-04-01 00:03:16,034 INFO L226 Difference]: Without dead ends: 339 [2023-04-01 00:03:16,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2802 GetRequests, 2732 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=584, Invalid=3322, Unknown=0, NotChecked=0, Total=3906 [2023-04-01 00:03:16,038 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 132 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 00:03:16,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 378 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 00:03:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-04-01 00:03:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 295. [2023-04-01 00:03:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 209 states have (on average 1.0956937799043063) internal successors, (229), 200 states have internal predecessors, (229), 60 states have call successors, (60), 50 states have call predecessors, (60), 25 states have return successors, (173), 44 states have call predecessors, (173), 59 states have call successors, (173) [2023-04-01 00:03:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 462 transitions. [2023-04-01 00:03:16,084 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 462 transitions. Word has length 1375 [2023-04-01 00:03:16,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:03:16,085 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 462 transitions. [2023-04-01 00:03:16,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.0) internal successors, (112), 29 states have internal predecessors, (112), 24 states have call successors, (36), 2 states have call predecessors, (36), 15 states have return successors, (45), 15 states have call predecessors, (45), 24 states have call successors, (45) [2023-04-01 00:03:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 462 transitions. [2023-04-01 00:03:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2023-04-01 00:03:16,096 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:03:16,097 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 86, 86, 71, 70, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 28, 26, 18, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:03:16,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 00:03:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:16,307 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:03:16,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:03:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash -757486682, now seen corresponding path program 10 times [2023-04-01 00:03:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:03:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738463009] [2023-04-01 00:03:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:03:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:03:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 42580 backedges. 765 proven. 2938 refuted. 0 times theorem prover too weak. 38877 trivial. 0 not checked. [2023-04-01 00:03:17,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:03:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738463009] [2023-04-01 00:03:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738463009] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:03:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892196106] [2023-04-01 00:03:17,766 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 00:03:17,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:03:17,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:03:17,768 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 00:03:17,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 00:03:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:03:18,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 00:03:18,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:03:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 42580 backedges. 518 proven. 4100 refuted. 0 times theorem prover too weak. 37962 trivial. 0 not checked. [2023-04-01 00:03:18,544 INFO L327 TraceCheckSpWp]: Computing backward predicates...