/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/Primes.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:01:07,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:01:07,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:01:07,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:01:07,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:01:07,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:01:07,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:01:07,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:01:07,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:01:07,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:01:07,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:01:07,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:01:07,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:01:07,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:01:07,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:01:07,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:01:07,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:01:07,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:01:07,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:01:07,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:01:07,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:01:07,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:01:07,343 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:01:07,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:01:07,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:01:07,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:01:07,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:01:07,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:01:07,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:01:07,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:01:07,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:01:07,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:01:07,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:01:07,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:01:07,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:01:07,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:01:07,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:01:07,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:01:07,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:01:07,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:01:07,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:01:07,374 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:01:07,397 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:01:07,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:01:07,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:01:07,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:01:07,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:01:07,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:01:07,413 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:01:07,413 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:01:07,414 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:01:07,414 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:01:07,414 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:01:07,414 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:01:07,415 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:01:07,415 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:01:07,415 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:01:07,415 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:01:07,415 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:01:07,415 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:01:07,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:01:07,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:01:07,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:01:07,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:07,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:01:07,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:01:07,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:01:07,420 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:01:07,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:01:07,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:01:07,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:01:07,791 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:01:07,791 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:01:07,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2023-04-01 00:01:08,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:01:08,989 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:01:08,990 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2023-04-01 00:01:08,994 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152cae9e4/f95b1f3bfb024e469bbdcf313c534836/FLAG7dfa6b30e [2023-04-01 00:01:09,004 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152cae9e4/f95b1f3bfb024e469bbdcf313c534836 [2023-04-01 00:01:09,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:01:09,006 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:01:09,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:09,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:01:09,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:01:09,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c7ad60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09, skipping insertion in model container [2023-04-01 00:01:09,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:01:09,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:01:09,174 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/Primes.c[2190,2203] [2023-04-01 00:01:09,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:09,191 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:01:09,220 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/Primes.c[2190,2203] [2023-04-01 00:01:09,221 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:01:09,229 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:01:09,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09 WrapperNode [2023-04-01 00:01:09,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:01:09,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:01:09,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:01:09,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:01:09,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,265 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:01:09,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:01:09,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:01:09,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:01:09,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (1/1) ... [2023-04-01 00:01:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:01:09,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:09,327 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:01:09,341 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:01:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:01:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:01:09,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:01:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2023-04-01 00:01:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2023-04-01 00:01:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime [2023-04-01 00:01:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2023-04-01 00:01:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:01:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:01:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:01:09,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:01:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:01:09,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:01:09,454 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:01:09,455 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:01:09,593 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:01:09,603 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:01:09,603 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 00:01:09,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:09 BoogieIcfgContainer [2023-04-01 00:01:09,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:01:09,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:01:09,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:01:09,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:01:09,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:01:09" (1/3) ... [2023-04-01 00:01:09,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d2584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:09, skipping insertion in model container [2023-04-01 00:01:09,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:01:09" (2/3) ... [2023-04-01 00:01:09,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d2584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:01:09, skipping insertion in model container [2023-04-01 00:01:09,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:01:09" (3/3) ... [2023-04-01 00:01:09,612 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2023-04-01 00:01:09,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:01:09,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:01:09,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:01:09,661 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;@6cc0431a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:01:09,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:01:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-04-01 00:01:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 00:01:09,670 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:09,671 INFO L195 NwaCegarLoop]: trace histogram [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:01:09,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:09,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1919913904, now seen corresponding path program 1 times [2023-04-01 00:01:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175755645] [2023-04-01 00:01:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:09,816 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:01:09,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175755645] [2023-04-01 00:01:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175755645] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 00:01:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773302742] [2023-04-01 00:01:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:09,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 00:01:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:09,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 00:01:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 00:01:09,852 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 00:01:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:09,911 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-04-01 00:01:09,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 00:01:09,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-04-01 00:01:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:09,918 INFO L225 Difference]: With dead ends: 66 [2023-04-01 00:01:09,918 INFO L226 Difference]: Without dead ends: 55 [2023-04-01 00:01:09,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 00:01:09,923 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:09,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-04-01 00:01:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-04-01 00:01:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-01 00:01:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2023-04-01 00:01:09,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 21 [2023-04-01 00:01:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:09,976 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2023-04-01 00:01:09,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 00:01:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2023-04-01 00:01:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-01 00:01:09,992 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:09,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:01:09,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:01:09,993 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:09,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:09,993 INFO L85 PathProgramCache]: Analyzing trace with hash -847330946, now seen corresponding path program 1 times [2023-04-01 00:01:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32447685] [2023-04-01 00:01:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:09,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,155 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:01:10,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:10,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32447685] [2023-04-01 00:01:10,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32447685] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:10,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:10,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-04-01 00:01:10,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977362345] [2023-04-01 00:01:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:10,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 00:01:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:10,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 00:01:10,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:10,158 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:10,204 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2023-04-01 00:01:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 00:01:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-04-01 00:01:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:10,206 INFO L225 Difference]: With dead ends: 78 [2023-04-01 00:01:10,206 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 00:01:10,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-04-01 00:01:10,208 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:10,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 465 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 00:01:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-04-01 00:01:10,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-04-01 00:01:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2023-04-01 00:01:10,224 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 28 [2023-04-01 00:01:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:10,224 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2023-04-01 00:01:10,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2023-04-01 00:01:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 00:01:10,226 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:10,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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:01:10,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:01:10,226 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:10,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 524252330, now seen corresponding path program 1 times [2023-04-01 00:01:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241130015] [2023-04-01 00:01:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,316 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:01:10,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241130015] [2023-04-01 00:01:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241130015] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:10,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:10,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:01:10,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937526479] [2023-04-01 00:01:10,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:10,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:10,319 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:10,366 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2023-04-01 00:01:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:01:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-04-01 00:01:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:10,368 INFO L225 Difference]: With dead ends: 63 [2023-04-01 00:01:10,368 INFO L226 Difference]: Without dead ends: 59 [2023-04-01 00:01:10,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:10,369 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:10,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 316 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-04-01 00:01:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-04-01 00:01:10,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:01:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2023-04-01 00:01:10,376 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 29 [2023-04-01 00:01:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:10,376 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2023-04-01 00:01:10,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-04-01 00:01:10,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2023-04-01 00:01:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-04-01 00:01:10,378 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:10,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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:01:10,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 00:01:10,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:10,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash -232403044, now seen corresponding path program 1 times [2023-04-01 00:01:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004099595] [2023-04-01 00:01:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,429 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:01:10,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004099595] [2023-04-01 00:01:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004099595] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:10,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:10,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871745202] [2023-04-01 00:01:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:10,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:10,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:10,432 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:10,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:10,471 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-04-01 00:01:10,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:10,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-04-01 00:01:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:10,472 INFO L225 Difference]: With dead ends: 65 [2023-04-01 00:01:10,472 INFO L226 Difference]: Without dead ends: 61 [2023-04-01 00:01:10,473 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:01:10,474 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:10,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 226 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-01 00:01:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-04-01 00:01:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-01 00:01:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2023-04-01 00:01:10,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2023-04-01 00:01:10,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:10,480 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2023-04-01 00:01:10,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:01:10,480 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2023-04-01 00:01:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 00:01:10,482 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:10,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:10,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 00:01:10,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:10,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1758941126, now seen corresponding path program 1 times [2023-04-01 00:01:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795149027] [2023-04-01 00:01:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:10,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795149027] [2023-04-01 00:01:10,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795149027] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:10,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628772428] [2023-04-01 00:01:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:10,553 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:01:10,554 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:01:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:10,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:10,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 00:01:10,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628772428] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [653633642] [2023-04-01 00:01:10,815 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 00:01:10,815 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:10,818 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:01:10,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2023-04-01 00:01:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805960229] [2023-04-01 00:01:10,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:10,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 00:01:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 00:01:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:10,821 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 00:01:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:10,919 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2023-04-01 00:01:10,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 00:01:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 37 [2023-04-01 00:01:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:10,921 INFO L225 Difference]: With dead ends: 74 [2023-04-01 00:01:10,921 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 00:01:10,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-04-01 00:01:10,922 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:10,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 457 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 00:01:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-04-01 00:01:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 00:01:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2023-04-01 00:01:10,927 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 37 [2023-04-01 00:01:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:10,927 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2023-04-01 00:01:10,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-04-01 00:01:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2023-04-01 00:01:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-01 00:01:10,928 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:10,928 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2023-04-01 00:01:10,936 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:01:11,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:11,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:11,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -901801858, now seen corresponding path program 1 times [2023-04-01 00:01:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561738466] [2023-04-01 00:01:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:11,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561738466] [2023-04-01 00:01:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561738466] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680714493] [2023-04-01 00:01:11,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:11,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:11,419 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:01:11,481 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:01:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:11,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 00:01:11,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:11,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 00:01:12,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680714493] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:12,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513703106] [2023-04-01 00:01:12,068 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 00:01:12,069 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:12,069 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:01:12,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2023-04-01 00:01:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313373594] [2023-04-01 00:01:12,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:12,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-01 00:01:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-01 00:01:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2023-04-01 00:01:12,077 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-01 00:01:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:12,371 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2023-04-01 00:01:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 00:01:12,373 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 38 [2023-04-01 00:01:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:12,374 INFO L225 Difference]: With dead ends: 78 [2023-04-01 00:01:12,374 INFO L226 Difference]: Without dead ends: 60 [2023-04-01 00:01:12,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 00:01:12,379 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:12,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 633 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-01 00:01:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2023-04-01 00:01:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 00:01:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-04-01 00:01:12,394 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-04-01 00:01:12,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:12,394 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-04-01 00:01:12,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 18 states have internal predecessors, (46), 7 states have call successors, (9), 1 states have call predecessors, (9), 7 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2023-04-01 00:01:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-04-01 00:01:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-04-01 00:01:12,397 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:12,397 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2023-04-01 00:01:12,419 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:01:12,602 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,SelfDestructingSolverStorable5 [2023-04-01 00:01:12,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:12,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1868540258, now seen corresponding path program 1 times [2023-04-01 00:01:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052231045] [2023-04-01 00:01:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:01:12,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:12,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052231045] [2023-04-01 00:01:12,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052231045] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:12,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:12,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 00:01:12,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434140948] [2023-04-01 00:01:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 00:01:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:12,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 00:01:12,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:12,740 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 00:01:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:12,776 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2023-04-01 00:01:12,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:01:12,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2023-04-01 00:01:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:12,777 INFO L225 Difference]: With dead ends: 80 [2023-04-01 00:01:12,777 INFO L226 Difference]: Without dead ends: 59 [2023-04-01 00:01:12,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:12,778 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:12,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 240 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-04-01 00:01:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2023-04-01 00:01:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-04-01 00:01:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-04-01 00:01:12,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 40 [2023-04-01 00:01:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:12,783 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-04-01 00:01:12,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-04-01 00:01:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-04-01 00:01:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-04-01 00:01:12,784 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:12,784 INFO L195 NwaCegarLoop]: trace histogram [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, 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:01:12,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-04-01 00:01:12,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:12,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1503203376, now seen corresponding path program 1 times [2023-04-01 00:01:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402838321] [2023-04-01 00:01:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:12,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-04-01 00:01:12,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:12,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402838321] [2023-04-01 00:01:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402838321] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:12,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:12,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 00:01:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909769786] [2023-04-01 00:01:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 00:01:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:12,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 00:01:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:01:12,853 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 00:01:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:12,869 INFO L93 Difference]: Finished difference Result 109 states and 136 transitions. [2023-04-01 00:01:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 00:01:12,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-04-01 00:01:12,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:12,870 INFO L225 Difference]: With dead ends: 109 [2023-04-01 00:01:12,870 INFO L226 Difference]: Without dead ends: 61 [2023-04-01 00:01:12,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:01:12,871 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:12,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:12,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-01 00:01:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-04-01 00:01:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2023-04-01 00:01:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2023-04-01 00:01:12,876 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 58 [2023-04-01 00:01:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:12,876 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2023-04-01 00:01:12,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-04-01 00:01:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2023-04-01 00:01:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-04-01 00:01:12,877 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:12,877 INFO L195 NwaCegarLoop]: trace histogram [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, 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:01:12,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-04-01 00:01:12,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:12,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1348993424, now seen corresponding path program 1 times [2023-04-01 00:01:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:12,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118241012] [2023-04-01 00:01:12,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:12,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 00:01:12,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118241012] [2023-04-01 00:01:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118241012] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:12,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105940050] [2023-04-01 00:01:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:12,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:12,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:12,988 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:01:13,003 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:01:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:13,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 00:01:13,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:13,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 00:01:13,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105940050] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:13,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 00:01:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2023-04-01 00:01:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190100274] [2023-04-01 00:01:13,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:13,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:13,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-04-01 00:01:13,083 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 00:01:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:13,122 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2023-04-01 00:01:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2023-04-01 00:01:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:13,123 INFO L225 Difference]: With dead ends: 116 [2023-04-01 00:01:13,123 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 00:01:13,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-04-01 00:01:13,124 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:13,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 179 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 00:01:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-04-01 00:01:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (19), 12 states have call predecessors, (19), 10 states have call successors, (19) [2023-04-01 00:01:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2023-04-01 00:01:13,129 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 59 [2023-04-01 00:01:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:13,130 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2023-04-01 00:01:13,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 00:01:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2023-04-01 00:01:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-04-01 00:01:13,131 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:13,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 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:01:13,151 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:01:13,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:13,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:13,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -544038658, now seen corresponding path program 1 times [2023-04-01 00:01:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:13,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066311261] [2023-04-01 00:01:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 00:01:13,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066311261] [2023-04-01 00:01:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066311261] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611519236] [2023-04-01 00:01:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:13,392 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 00:01:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:13,411 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2023-04-01 00:01:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 64 [2023-04-01 00:01:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:13,413 INFO L225 Difference]: With dead ends: 124 [2023-04-01 00:01:13,413 INFO L226 Difference]: Without dead ends: 69 [2023-04-01 00:01:13,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:13,414 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:13,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-04-01 00:01:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2023-04-01 00:01:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 45 states have internal predecessors, (51), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2023-04-01 00:01:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2023-04-01 00:01:13,418 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 64 [2023-04-01 00:01:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:13,418 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2023-04-01 00:01:13,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2023-04-01 00:01:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2023-04-01 00:01:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-01 00:01:13,419 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:13,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 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, 1, 1, 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:01:13,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-04-01 00:01:13,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:13,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1724124320, now seen corresponding path program 1 times [2023-04-01 00:01:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654860655] [2023-04-01 00:01:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-04-01 00:01:13,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654860655] [2023-04-01 00:01:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654860655] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:01:13,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536699503] [2023-04-01 00:01:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:13,475 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2023-04-01 00:01:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:13,496 INFO L93 Difference]: Finished difference Result 127 states and 164 transitions. [2023-04-01 00:01:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:01:13,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2023-04-01 00:01:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:13,497 INFO L225 Difference]: With dead ends: 127 [2023-04-01 00:01:13,497 INFO L226 Difference]: Without dead ends: 71 [2023-04-01 00:01:13,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:13,498 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:13,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-01 00:01:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-04-01 00:01:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 11 states have call successors, (11), 6 states have call predecessors, (11), 9 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2023-04-01 00:01:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2023-04-01 00:01:13,502 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 73 [2023-04-01 00:01:13,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:13,502 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2023-04-01 00:01:13,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2023-04-01 00:01:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2023-04-01 00:01:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-04-01 00:01:13,503 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:13,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 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:01:13,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-04-01 00:01:13,503 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:13,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1661468794, now seen corresponding path program 1 times [2023-04-01 00:01:13,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24618084] [2023-04-01 00:01:13,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:13,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 00:01:13,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:13,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24618084] [2023-04-01 00:01:13,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24618084] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462537865] [2023-04-01 00:01:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:13,566 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:01:13,597 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:01:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:13,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 00:01:13,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-04-01 00:01:13,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-04-01 00:01:13,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462537865] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:13,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798297972] [2023-04-01 00:01:13,876 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2023-04-01 00:01:13,876 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:13,876 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:01:13,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:13,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-04-01 00:01:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12706965] [2023-04-01 00:01:13,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:13,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 00:01:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:13,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 00:01:13,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:13,878 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 00:01:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:13,924 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2023-04-01 00:01:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 7 states have call successors, (14) Word has length 74 [2023-04-01 00:01:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:13,925 INFO L225 Difference]: With dead ends: 134 [2023-04-01 00:01:13,925 INFO L226 Difference]: Without dead ends: 64 [2023-04-01 00:01:13,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-04-01 00:01:13,925 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 14 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:13,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 235 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-04-01 00:01:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2023-04-01 00:01:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 44 states have internal predecessors, (48), 10 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2023-04-01 00:01:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-04-01 00:01:13,929 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 74 [2023-04-01 00:01:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:13,929 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-04-01 00:01:13,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 7 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 7 states have call successors, (14) [2023-04-01 00:01:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2023-04-01 00:01:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-04-01 00:01:13,929 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:13,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 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:01:13,937 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:01:14,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:14,135 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:14,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1582983988, now seen corresponding path program 1 times [2023-04-01 00:01:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499874068] [2023-04-01 00:01:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 00:01:14,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:14,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499874068] [2023-04-01 00:01:14,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499874068] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:14,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:14,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 00:01:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729685430] [2023-04-01 00:01:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:14,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-01 00:01:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-01 00:01:14,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:14,185 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2023-04-01 00:01:14,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:14,212 INFO L93 Difference]: Finished difference Result 123 states and 152 transitions. [2023-04-01 00:01:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 00:01:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2023-04-01 00:01:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:14,213 INFO L225 Difference]: With dead ends: 123 [2023-04-01 00:01:14,213 INFO L226 Difference]: Without dead ends: 70 [2023-04-01 00:01:14,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-01 00:01:14,214 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:14,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-04-01 00:01:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2023-04-01 00:01:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (18), 12 states have call predecessors, (18), 9 states have call successors, (18) [2023-04-01 00:01:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2023-04-01 00:01:14,217 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 74 [2023-04-01 00:01:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:14,218 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2023-04-01 00:01:14,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2023-04-01 00:01:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2023-04-01 00:01:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-04-01 00:01:14,218 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:14,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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:01:14,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-04-01 00:01:14,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:14,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 396500608, now seen corresponding path program 1 times [2023-04-01 00:01:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:14,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309189659] [2023-04-01 00:01:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:14,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309189659] [2023-04-01 00:01:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309189659] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973358557] [2023-04-01 00:01:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:14,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:14,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:14,296 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:01:14,298 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:01:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:14,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2023-04-01 00:01:14,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:14,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-04-01 00:01:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973358557] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2031088645] [2023-04-01 00:01:14,713 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2023-04-01 00:01:14,713 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:14,714 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:01:14,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2023-04-01 00:01:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679458549] [2023-04-01 00:01:14,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:14,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 00:01:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:14,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 00:01:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-04-01 00:01:14,715 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-01 00:01:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:14,817 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2023-04-01 00:01:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 00:01:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 9 states have call successors, (14) Word has length 68 [2023-04-01 00:01:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:14,818 INFO L225 Difference]: With dead ends: 102 [2023-04-01 00:01:14,818 INFO L226 Difference]: Without dead ends: 71 [2023-04-01 00:01:14,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-04-01 00:01:14,818 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 28 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:14,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 242 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-01 00:01:14,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-04-01 00:01:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 12 states have return successors, (22), 14 states have call predecessors, (22), 9 states have call successors, (22) [2023-04-01 00:01:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2023-04-01 00:01:14,822 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 68 [2023-04-01 00:01:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:14,822 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2023-04-01 00:01:14,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 9 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 9 states have call successors, (14) [2023-04-01 00:01:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2023-04-01 00:01:14,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-04-01 00:01:14,822 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:14,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:14,830 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:01:15,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 00:01:15,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:15,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -845896930, now seen corresponding path program 2 times [2023-04-01 00:01:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887493888] [2023-04-01 00:01:15,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:01:15,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887493888] [2023-04-01 00:01:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887493888] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304103626] [2023-04-01 00:01:15,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:15,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:15,161 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:01:15,189 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:01:15,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-04-01 00:01:15,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:15,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 00:01:15,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 00:01:15,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 00:01:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304103626] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [339112106] [2023-04-01 00:01:16,005 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2023-04-01 00:01:16,005 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:16,006 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:01:16,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:16,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2023-04-01 00:01:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193916464] [2023-04-01 00:01:16,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:16,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-04-01 00:01:16,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-04-01 00:01:16,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2023-04-01 00:01:16,008 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 20 states, 17 states have (on average 5.470588235294118) internal successors, (93), 20 states have internal predecessors, (93), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:01:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:16,147 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2023-04-01 00:01:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 00:01:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 5.470588235294118) internal successors, (93), 20 states have internal predecessors, (93), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 12 states have call successors, (19) Word has length 77 [2023-04-01 00:01:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:16,149 INFO L225 Difference]: With dead ends: 115 [2023-04-01 00:01:16,149 INFO L226 Difference]: Without dead ends: 94 [2023-04-01 00:01:16,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:01:16,149 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 63 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:16,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 388 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-04-01 00:01:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 83. [2023-04-01 00:01:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.125) internal successors, (63), 58 states have internal predecessors, (63), 11 states have call successors, (11), 6 states have call predecessors, (11), 15 states have return successors, (31), 18 states have call predecessors, (31), 10 states have call successors, (31) [2023-04-01 00:01:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2023-04-01 00:01:16,154 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 77 [2023-04-01 00:01:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:16,154 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2023-04-01 00:01:16,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 5.470588235294118) internal successors, (93), 20 states have internal predecessors, (93), 12 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (19), 6 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 00:01:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2023-04-01 00:01:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-04-01 00:01:16,155 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:16,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 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, 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:01:16,162 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:01:16,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-04-01 00:01:16,362 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:16,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2111320458, now seen corresponding path program 1 times [2023-04-01 00:01:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129520749] [2023-04-01 00:01:16,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:16,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-04-01 00:01:16,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129520749] [2023-04-01 00:01:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129520749] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:01:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:01:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:01:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834246063] [2023-04-01 00:01:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:01:16,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:01:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:01:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:01:16,404 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-01 00:01:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:16,435 INFO L93 Difference]: Finished difference Result 157 states and 222 transitions. [2023-04-01 00:01:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:01:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 84 [2023-04-01 00:01:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:16,436 INFO L225 Difference]: With dead ends: 157 [2023-04-01 00:01:16,436 INFO L226 Difference]: Without dead ends: 83 [2023-04-01 00:01:16,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-04-01 00:01:16,437 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:16,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:01:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-04-01 00:01:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-04-01 00:01:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.125) internal successors, (63), 58 states have internal predecessors, (63), 11 states have call successors, (11), 6 states have call predecessors, (11), 15 states have return successors, (28), 18 states have call predecessors, (28), 10 states have call successors, (28) [2023-04-01 00:01:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2023-04-01 00:01:16,443 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 84 [2023-04-01 00:01:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:16,443 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2023-04-01 00:01:16,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-01 00:01:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2023-04-01 00:01:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-04-01 00:01:16,444 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:01:16,444 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 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, 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:01:16,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-04-01 00:01:16,444 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:01:16,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:01:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1981813722, now seen corresponding path program 2 times [2023-04-01 00:01:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:01:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659589718] [2023-04-01 00:01:16,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:01:16,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:01:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:01:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 19 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 00:01:16,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:01:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659589718] [2023-04-01 00:01:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659589718] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:01:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456615765] [2023-04-01 00:01:16,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 00:01:16,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:16,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:01:16,611 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:01:16,613 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:01:16,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-04-01 00:01:16,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 00:01:16,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjunts are in the unsatisfiable core [2023-04-01 00:01:16,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:01:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-04-01 00:01:16,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:01:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-01 00:01:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456615765] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:01:17,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1157240766] [2023-04-01 00:01:17,634 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2023-04-01 00:01:17,634 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:01:17,634 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:01:17,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:01:17,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2023-04-01 00:01:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365427502] [2023-04-01 00:01:17,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 00:01:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 00:01:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:01:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 00:01:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2023-04-01 00:01:17,636 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 21 states have internal predecessors, (100), 9 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (19), 6 states have call predecessors, (19), 9 states have call successors, (19) [2023-04-01 00:01:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:01:17,809 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2023-04-01 00:01:17,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 00:01:17,810 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 21 states have internal predecessors, (100), 9 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (19), 6 states have call predecessors, (19), 9 states have call successors, (19) Word has length 93 [2023-04-01 00:01:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:01:17,811 INFO L225 Difference]: With dead ends: 126 [2023-04-01 00:01:17,811 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 00:01:17,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2023-04-01 00:01:17,812 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:01:17,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 281 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:01:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 00:01:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 00:01:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 00:01:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 00:01:17,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2023-04-01 00:01:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:01:17,813 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 00:01:17,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 21 states have internal predecessors, (100), 9 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (19), 6 states have call predecessors, (19), 9 states have call successors, (19) [2023-04-01 00:01:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 00:01:17,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 00:01:17,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 00:01:17,823 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:01:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:01:18,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (<= |multiple_of_#in~n| multiple_of_~n) (<= |multiple_of_#in~m| multiple_of_~m) (<= (+ |multiple_of_#in~m| 1) 0)) [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n) (< 0 multiple_of_~n)) [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 31 45) the Hoare annotation is: true [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-04-01 00:01:18,195 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= (+ multiple_of_~n 1) 0) (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n)) [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= |mult_#in~n| mult_~n) (<= |mult_#in~m| mult_~m) (< 1 mult_~m)) [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 28) the Hoare annotation is: true [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2023-04-01 00:01:18,196 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2023-04-01 00:01:18,197 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2023-04-01 00:01:18,197 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2023-04-01 00:01:18,197 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-04-01 00:01:18,197 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 57 74) the Hoare annotation is: true [2023-04-01 00:01:18,197 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (or (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|) (and (<= |is_prime__#in~n| |is_prime__#in~m|) (< 2 is_prime__~n))) (<= 2 is_prime__~m) (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m)) (<= is_prime__~m |is_prime__#in~m|)) [2023-04-01 00:01:18,197 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-04-01 00:01:18,197 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (<= 2 is_prime__~m) (<= (+ |is_prime__#in~m| is_prime__~n) (+ |is_prime__#in~n| is_prime__~m)) (< 2 is_prime__~n) (<= is_prime__~m |is_prime__#in~m|)) [2023-04-01 00:01:18,197 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-04-01 00:01:18,198 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2023-04-01 00:01:18,198 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-04-01 00:01:18,198 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= main_~n~0 2) (<= 1 main_~n~0)) [2023-04-01 00:01:18,198 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-04-01 00:01:18,198 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2023-04-01 00:01:18,198 INFO L899 garLoopResultBuilder]: For program point L97-5(lines 76 102) no Hoare annotation was computed. [2023-04-01 00:01:18,199 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-04-01 00:01:18,199 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 76 102) no Hoare annotation was computed. [2023-04-01 00:01:18,199 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-04-01 00:01:18,199 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (<= 1 main_~n~0) [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 76 102) the Hoare annotation is: true [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 52 54) the Hoare annotation is: true [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point is_primeEXIT(lines 52 54) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (= is_prime_~n |is_prime_#in~n|) [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:01:18,200 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2023-04-01 00:01:18,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 00:01:18,201 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 00:01:18,204 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:01:18,207 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 00:01:18,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:01:18 BoogieIcfgContainer [2023-04-01 00:01:18,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 00:01:18,210 INFO L158 Benchmark]: Toolchain (without parser) took 9203.34ms. Allocated memory was 183.5MB in the beginning and 269.5MB in the end (delta: 86.0MB). Free memory was 143.3MB in the beginning and 225.5MB in the end (delta: -82.2MB). Peak memory consumption was 153.0MB. Max. memory is 8.0GB. [2023-04-01 00:01:18,210 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 00:01:18,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.08ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 131.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 00:01:18,211 INFO L158 Benchmark]: Boogie Preprocessor took 36.09ms. Allocated memory is still 183.5MB. Free memory was 131.6MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-04-01 00:01:18,211 INFO L158 Benchmark]: RCFGBuilder took 337.98ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 115.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-04-01 00:01:18,211 INFO L158 Benchmark]: TraceAbstraction took 8602.66ms. Allocated memory was 183.5MB in the beginning and 269.5MB in the end (delta: 86.0MB). Free memory was 114.6MB in the beginning and 225.5MB in the end (delta: -111.0MB). Peak memory consumption was 123.6MB. Max. memory is 8.0GB. [2023-04-01 00:01:18,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.08ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 131.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.09ms. Allocated memory is still 183.5MB. Free memory was 131.6MB in the beginning and 130.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 337.98ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 115.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8602.66ms. Allocated memory was 183.5MB in the beginning and 269.5MB in the end (delta: 86.0MB). Free memory was 114.6MB in the beginning and 225.5MB in the end (delta: -111.0MB). Peak memory consumption was 123.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 98]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 4942 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3974 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1360 IncrementalHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 968 mSDtfsCounter, 1360 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 807 SyntacticMatches, 19 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=15, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 260 PreInvPairs, 304 NumberOfFragments, 122 HoareAnnotationTreeSize, 260 FomulaSimplifications, 219 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1384 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1750 ConstructedInterpolants, 0 QuantifiedInterpolants, 3755 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1325 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 512/697 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-04-01 00:01:18,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...