./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f63c6229f0a09709710be77b7ac5a08c2c6f5392 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 12:52:38,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 12:52:38,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 12:52:38,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 12:52:38,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 12:52:38,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 12:52:38,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 12:52:38,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 12:52:38,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 12:52:38,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 12:52:38,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 12:52:38,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 12:52:38,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 12:52:38,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 12:52:38,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 12:52:38,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 12:52:38,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 12:52:38,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 12:52:38,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 12:52:38,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 12:52:38,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 12:52:38,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 12:52:38,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 12:52:38,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 12:52:38,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 12:52:38,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 12:52:38,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 12:52:38,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 12:52:38,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 12:52:38,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 12:52:38,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 12:52:38,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 12:52:38,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 12:52:38,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 12:52:38,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 12:52:38,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 12:52:38,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 12:52:38,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 12:52:38,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 12:52:38,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 12:52:38,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 12:52:38,188 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 12:52:38,213 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 12:52:38,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 12:52:38,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 12:52:38,214 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 12:52:38,214 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 12:52:38,215 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 12:52:38,215 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 12:52:38,215 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 12:52:38,215 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 12:52:38,215 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 12:52:38,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 12:52:38,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 12:52:38,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 12:52:38,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:52:38,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 12:52:38,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 12:52:38,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 12:52:38,218 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 12:52:38,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 12:52:38,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 12:52:38,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 12:52:38,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 12:52:38,219 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f63c6229f0a09709710be77b7ac5a08c2c6f5392 [2020-12-09 12:52:38,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 12:52:38,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 12:52:38,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 12:52:38,423 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 12:52:38,424 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 12:52:38,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-12-09 12:52:38,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/data/7043e7df6/3780566e3883481f9e0a11d2d58a2a24/FLAG9a1bb11fe [2020-12-09 12:52:38,816 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 12:52:38,817 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2020-12-09 12:52:38,822 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/data/7043e7df6/3780566e3883481f9e0a11d2d58a2a24/FLAG9a1bb11fe [2020-12-09 12:52:39,272 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/data/7043e7df6/3780566e3883481f9e0a11d2d58a2a24 [2020-12-09 12:52:39,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 12:52:39,278 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 12:52:39,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 12:52:39,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 12:52:39,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 12:52:39,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4f4e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39, skipping insertion in model container [2020-12-09 12:52:39,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 12:52:39,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 12:52:39,395 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2020-12-09 12:52:39,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:52:39,404 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 12:52:39,420 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c[947,960] [2020-12-09 12:52:39,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 12:52:39,430 INFO L208 MainTranslator]: Completed translation [2020-12-09 12:52:39,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39 WrapperNode [2020-12-09 12:52:39,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 12:52:39,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 12:52:39,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 12:52:39,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 12:52:39,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 12:52:39,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 12:52:39,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 12:52:39,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 12:52:39,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... [2020-12-09 12:52:39,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 12:52:39,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 12:52:39,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 12:52:39,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 12:52:39,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 12:52:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 12:52:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-12-09 12:52:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-12-09 12:52:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 12:52:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-12-09 12:52:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-12-09 12:52:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 12:52:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 12:52:39,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 12:52:39,691 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-09 12:52:39,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:39 BoogieIcfgContainer [2020-12-09 12:52:39,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 12:52:39,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 12:52:39,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 12:52:39,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 12:52:39,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:52:39" (1/3) ... [2020-12-09 12:52:39,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55542c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:52:39, skipping insertion in model container [2020-12-09 12:52:39,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:52:39" (2/3) ... [2020-12-09 12:52:39,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55542c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:52:39, skipping insertion in model container [2020-12-09 12:52:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:39" (3/3) ... [2020-12-09 12:52:39,700 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-12-09 12:52:39,710 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 12:52:39,712 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 12:52:39,720 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 12:52:39,737 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 12:52:39,737 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 12:52:39,737 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 12:52:39,737 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 12:52:39,737 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 12:52:39,737 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 12:52:39,737 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 12:52:39,737 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 12:52:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-12-09 12:52:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 12:52:39,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:39,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:39,754 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2020-12-09 12:52:39,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:39,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531139442] [2020-12-09 12:52:39,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:52:39,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531139442] [2020-12-09 12:52:39,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:52:39,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:52:39,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023437647] [2020-12-09 12:52:39,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:52:39,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:52:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:52:39,929 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 5 states. [2020-12-09 12:52:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:39,963 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-12-09 12:52:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:52:39,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-12-09 12:52:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:39,970 INFO L225 Difference]: With dead ends: 36 [2020-12-09 12:52:39,970 INFO L226 Difference]: Without dead ends: 26 [2020-12-09 12:52:39,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:52:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-09 12:52:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-09 12:52:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 12:52:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 12:52:40,001 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2020-12-09 12:52:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:40,002 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 12:52:40,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:52:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 12:52:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 12:52:40,003 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:40,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:40,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 12:52:40,003 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2020-12-09 12:52:40,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:40,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152379481] [2020-12-09 12:52:40,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 12:52:40,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152379481] [2020-12-09 12:52:40,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 12:52:40,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 12:52:40,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804969674] [2020-12-09 12:52:40,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 12:52:40,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 12:52:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:52:40,040 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2020-12-09 12:52:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:40,054 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-12-09 12:52:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 12:52:40,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-09 12:52:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:40,056 INFO L225 Difference]: With dead ends: 32 [2020-12-09 12:52:40,056 INFO L226 Difference]: Without dead ends: 28 [2020-12-09 12:52:40,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 12:52:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-09 12:52:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-09 12:52:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-09 12:52:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-12-09 12:52:40,062 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2020-12-09 12:52:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:40,062 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-12-09 12:52:40,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 12:52:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-12-09 12:52:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-09 12:52:40,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:40,063 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:40,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 12:52:40,064 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2020-12-09 12:52:40,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:40,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833506232] [2020-12-09 12:52:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:40,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833506232] [2020-12-09 12:52:40,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999922598] [2020-12-09 12:52:40,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:40,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:52:40,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:40,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:40,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353886683] [2020-12-09 12:52:40,418 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-12-09 12:52:40,418 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:40,421 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:52:40,425 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:52:40,426 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:52:40,611 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:40,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:40,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2020-12-09 12:52:40,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88451398] [2020-12-09 12:52:40,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-09 12:52:40,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:40,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-09 12:52:40,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:52:40,614 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2020-12-09 12:52:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:40,725 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-12-09 12:52:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 12:52:40,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-12-09 12:52:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:40,727 INFO L225 Difference]: With dead ends: 54 [2020-12-09 12:52:40,727 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 12:52:40,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:52:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 12:52:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-12-09 12:52:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-09 12:52:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-09 12:52:40,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2020-12-09 12:52:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:40,732 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-09 12:52:40,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-09 12:52:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-09 12:52:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 12:52:40,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:40,734 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:40,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 12:52:40,936 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:40,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2020-12-09 12:52:40,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:40,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530181998] [2020-12-09 12:52:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:41,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530181998] [2020-12-09 12:52:41,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007740742] [2020-12-09 12:52:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:41,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 12:52:41,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:41,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 12:52:41,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639123742] [2020-12-09 12:52:41,300 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 12:52:41,300 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:41,301 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 12:52:41,302 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 12:52:41,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 12:52:41,415 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.TopInputCallSummarizer.summarize(TopInputCallSummarizer.java:67) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretCallReturnSummary(DagInterpreter.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:207) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:41,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:41,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2020-12-09 12:52:41,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131920509] [2020-12-09 12:52:41,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 12:52:41,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 12:52:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-09 12:52:41,417 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-12-09 12:52:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:41,491 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-12-09 12:52:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 12:52:41,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-12-09 12:52:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:41,493 INFO L225 Difference]: With dead ends: 39 [2020-12-09 12:52:41,493 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 12:52:41,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-12-09 12:52:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 12:52:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2020-12-09 12:52:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-09 12:52:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-12-09 12:52:41,499 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2020-12-09 12:52:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:41,499 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-12-09 12:52:41,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 12:52:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-12-09 12:52:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-09 12:52:41,501 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:41,501 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:41,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-09 12:52:41,703 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:41,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2020-12-09 12:52:41,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:41,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732682891] [2020-12-09 12:52:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 12:52:41,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732682891] [2020-12-09 12:52:41,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342597769] [2020-12-09 12:52:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:41,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 12:52:41,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 12:52:41,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:52:42,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114601620] [2020-12-09 12:52:42,189 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:42,189 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:42,189 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:42,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:42,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2020-12-09 12:52:42,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847072020] [2020-12-09 12:52:42,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-09 12:52:42,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:42,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-09 12:52:42,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-09 12:52:42,191 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2020-12-09 12:52:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:42,325 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2020-12-09 12:52:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 12:52:42,326 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-12-09 12:52:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:42,327 INFO L225 Difference]: With dead ends: 66 [2020-12-09 12:52:42,327 INFO L226 Difference]: Without dead ends: 35 [2020-12-09 12:52:42,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-12-09 12:52:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-09 12:52:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-09 12:52:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-09 12:52:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2020-12-09 12:52:42,333 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2020-12-09 12:52:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:42,333 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2020-12-09 12:52:42,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-09 12:52:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-12-09 12:52:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-09 12:52:42,334 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:42,334 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:42,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-09 12:52:42,536 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2020-12-09 12:52:42,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:42,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481731227] [2020-12-09 12:52:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-09 12:52:42,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481731227] [2020-12-09 12:52:42,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910635215] [2020-12-09 12:52:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:42,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 12:52:42,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 12:52:42,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 12:52:42,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [172391081] [2020-12-09 12:52:42,933 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:42,933 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:42,933 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:42,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:42,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2020-12-09 12:52:42,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925422003] [2020-12-09 12:52:42,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 12:52:42,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:42,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 12:52:42,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-12-09 12:52:42,935 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 18 states. [2020-12-09 12:52:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:43,254 INFO L93 Difference]: Finished difference Result 98 states and 158 transitions. [2020-12-09 12:52:43,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 12:52:43,254 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-12-09 12:52:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:43,256 INFO L225 Difference]: With dead ends: 98 [2020-12-09 12:52:43,256 INFO L226 Difference]: Without dead ends: 65 [2020-12-09 12:52:43,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2020-12-09 12:52:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-09 12:52:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2020-12-09 12:52:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 12:52:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2020-12-09 12:52:43,266 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 36 [2020-12-09 12:52:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:43,266 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2020-12-09 12:52:43,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 12:52:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2020-12-09 12:52:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-09 12:52:43,268 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:43,269 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:43,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:43,470 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2020-12-09 12:52:43,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:43,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634382613] [2020-12-09 12:52:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-09 12:52:43,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634382613] [2020-12-09 12:52:43,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852135527] [2020-12-09 12:52:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:43,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-09 12:52:43,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-09 12:52:43,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-09 12:52:44,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [182360363] [2020-12-09 12:52:44,050 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:44,050 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:44,050 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:44,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:44,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2020-12-09 12:52:44,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042745732] [2020-12-09 12:52:44,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 12:52:44,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 12:52:44,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-12-09 12:52:44,052 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 17 states. [2020-12-09 12:52:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:44,198 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2020-12-09 12:52:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 12:52:44,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-12-09 12:52:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:44,202 INFO L225 Difference]: With dead ends: 102 [2020-12-09 12:52:44,202 INFO L226 Difference]: Without dead ends: 98 [2020-12-09 12:52:44,203 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2020-12-09 12:52:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-12-09 12:52:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2020-12-09 12:52:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-09 12:52:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2020-12-09 12:52:44,220 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 50 [2020-12-09 12:52:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:44,220 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2020-12-09 12:52:44,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 12:52:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2020-12-09 12:52:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-12-09 12:52:44,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:44,224 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:44,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-09 12:52:44,425 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash -110138383, now seen corresponding path program 1 times [2020-12-09 12:52:44,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:44,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448083543] [2020-12-09 12:52:44,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2020-12-09 12:52:44,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448083543] [2020-12-09 12:52:44,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785528797] [2020-12-09 12:52:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:44,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 12:52:44,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2020-12-09 12:52:44,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-12-09 12:52:45,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [193806861] [2020-12-09 12:52:45,332 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:45,332 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:45,332 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:45,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:45,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2020-12-09 12:52:45,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733820188] [2020-12-09 12:52:45,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-12-09 12:52:45,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:45,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-12-09 12:52:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2020-12-09 12:52:45,334 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 23 states. [2020-12-09 12:52:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:45,865 INFO L93 Difference]: Finished difference Result 175 states and 367 transitions. [2020-12-09 12:52:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-09 12:52:45,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2020-12-09 12:52:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:45,867 INFO L225 Difference]: With dead ends: 175 [2020-12-09 12:52:45,867 INFO L226 Difference]: Without dead ends: 101 [2020-12-09 12:52:45,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2020-12-09 12:52:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-09 12:52:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-09 12:52:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-09 12:52:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2020-12-09 12:52:45,881 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 106 [2020-12-09 12:52:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:45,882 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2020-12-09 12:52:45,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-12-09 12:52:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2020-12-09 12:52:45,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-09 12:52:45,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:45,884 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 14, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:46,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:46,086 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1888157483, now seen corresponding path program 2 times [2020-12-09 12:52:46,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:46,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923659967] [2020-12-09 12:52:46,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 60 proven. 266 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2020-12-09 12:52:46,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923659967] [2020-12-09 12:52:46,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402481924] [2020-12-09 12:52:46,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:46,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-09 12:52:46,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:52:46,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 12:52:46,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 376 proven. 6 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2020-12-09 12:52:46,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 301 proven. 12 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2020-12-09 12:52:47,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1013498608] [2020-12-09 12:52:47,094 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:47,094 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:47,095 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:47,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:47,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2020-12-09 12:52:47,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360964647] [2020-12-09 12:52:47,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 12:52:47,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 12:52:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-12-09 12:52:47,096 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand 18 states. [2020-12-09 12:52:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:47,442 INFO L93 Difference]: Finished difference Result 205 states and 314 transitions. [2020-12-09 12:52:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-09 12:52:47,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 212 [2020-12-09 12:52:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:47,444 INFO L225 Difference]: With dead ends: 205 [2020-12-09 12:52:47,444 INFO L226 Difference]: Without dead ends: 124 [2020-12-09 12:52:47,445 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 417 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2020-12-09 12:52:47,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-12-09 12:52:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2020-12-09 12:52:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-09 12:52:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2020-12-09 12:52:47,458 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 212 [2020-12-09 12:52:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:47,458 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2020-12-09 12:52:47,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 12:52:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2020-12-09 12:52:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-09 12:52:47,460 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:47,461 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 10, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:47,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2020-12-09 12:52:47,662 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:47,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -225787115, now seen corresponding path program 1 times [2020-12-09 12:52:47,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:47,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331066980] [2020-12-09 12:52:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 67 proven. 171 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2020-12-09 12:52:47,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331066980] [2020-12-09 12:52:47,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437754146] [2020-12-09 12:52:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:47,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 12:52:47,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 250 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2020-12-09 12:52:48,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 30 proven. 266 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2020-12-09 12:52:48,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [595199463] [2020-12-09 12:52:48,979 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:48,980 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:48,980 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:48,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:48,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 25 [2020-12-09 12:52:48,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490321303] [2020-12-09 12:52:48,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 12:52:48,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 12:52:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-12-09 12:52:48,982 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand 25 states. [2020-12-09 12:52:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:49,560 INFO L93 Difference]: Finished difference Result 225 states and 391 transitions. [2020-12-09 12:52:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-09 12:52:49,561 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 160 [2020-12-09 12:52:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:49,562 INFO L225 Difference]: With dead ends: 225 [2020-12-09 12:52:49,562 INFO L226 Difference]: Without dead ends: 127 [2020-12-09 12:52:49,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2020-12-09 12:52:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-09 12:52:49,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2020-12-09 12:52:49,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-12-09 12:52:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2020-12-09 12:52:49,572 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 160 [2020-12-09 12:52:49,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:49,572 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2020-12-09 12:52:49,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 12:52:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2020-12-09 12:52:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-09 12:52:49,575 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:49,575 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:49,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-09 12:52:49,775 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash -895030172, now seen corresponding path program 1 times [2020-12-09 12:52:49,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:49,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231684722] [2020-12-09 12:52:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 119 proven. 253 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2020-12-09 12:52:49,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231684722] [2020-12-09 12:52:49,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034186560] [2020-12-09 12:52:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:49,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 12:52:49,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 70 proven. 425 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-12-09 12:52:50,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 70 proven. 449 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2020-12-09 12:52:51,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [560781980] [2020-12-09 12:52:51,518 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:51,518 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:51,518 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:51,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:51,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 17] total 22 [2020-12-09 12:52:51,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935544331] [2020-12-09 12:52:51,520 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-09 12:52:51,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:51,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-09 12:52:51,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2020-12-09 12:52:51,520 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand 22 states. [2020-12-09 12:52:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:51,764 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2020-12-09 12:52:51,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-09 12:52:51,764 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 227 [2020-12-09 12:52:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:51,766 INFO L225 Difference]: With dead ends: 137 [2020-12-09 12:52:51,766 INFO L226 Difference]: Without dead ends: 133 [2020-12-09 12:52:51,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 443 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=785, Unknown=0, NotChecked=0, Total=992 [2020-12-09 12:52:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-12-09 12:52:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2020-12-09 12:52:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-12-09 12:52:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 202 transitions. [2020-12-09 12:52:51,776 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 202 transitions. Word has length 227 [2020-12-09 12:52:51,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:51,776 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 202 transitions. [2020-12-09 12:52:51,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-09 12:52:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 202 transitions. [2020-12-09 12:52:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2020-12-09 12:52:51,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:51,784 INFO L422 BasicCegarLoop]: trace histogram [40, 40, 37, 37, 31, 30, 20, 20, 20, 20, 20, 20, 20, 18, 18, 18, 18, 18, 18, 18, 13, 10, 9, 7, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:51,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 12:52:51,986 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1813803180, now seen corresponding path program 2 times [2020-12-09 12:52:51,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:51,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718685968] [2020-12-09 12:52:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:52,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 799 proven. 423 refuted. 0 times theorem prover too weak. 6834 trivial. 0 not checked. [2020-12-09 12:52:52,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718685968] [2020-12-09 12:52:52,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605502179] [2020-12-09 12:52:52,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:52,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-12-09 12:52:52,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:52:52,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 12:52:52,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 1136 proven. 31 refuted. 0 times theorem prover too weak. 6889 trivial. 0 not checked. [2020-12-09 12:52:52,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8056 backedges. 1136 proven. 32 refuted. 0 times theorem prover too weak. 6888 trivial. 0 not checked. [2020-12-09 12:52:54,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601042693] [2020-12-09 12:52:54,399 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:54,399 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:54,399 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:54,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:54,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 27 [2020-12-09 12:52:54,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780150584] [2020-12-09 12:52:54,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 12:52:54,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 12:52:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2020-12-09 12:52:54,402 INFO L87 Difference]: Start difference. First operand 125 states and 202 transitions. Second operand 27 states. [2020-12-09 12:52:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:54,858 INFO L93 Difference]: Finished difference Result 299 states and 558 transitions. [2020-12-09 12:52:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-09 12:52:54,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 526 [2020-12-09 12:52:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:54,861 INFO L225 Difference]: With dead ends: 299 [2020-12-09 12:52:54,861 INFO L226 Difference]: Without dead ends: 173 [2020-12-09 12:52:54,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=0, NotChecked=0, Total=1806 [2020-12-09 12:52:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-09 12:52:54,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2020-12-09 12:52:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-12-09 12:52:54,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2020-12-09 12:52:54,872 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 526 [2020-12-09 12:52:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:54,873 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2020-12-09 12:52:54,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 12:52:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2020-12-09 12:52:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2020-12-09 12:52:54,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:54,877 INFO L422 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 43, 36, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 19, 14, 12, 2, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:55,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2020-12-09 12:52:55,078 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:55,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1457438074, now seen corresponding path program 3 times [2020-12-09 12:52:55,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:55,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230068277] [2020-12-09 12:52:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12033 backedges. 426 proven. 1090 refuted. 0 times theorem prover too weak. 10517 trivial. 0 not checked. [2020-12-09 12:52:55,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230068277] [2020-12-09 12:52:55,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353516650] [2020-12-09 12:52:55,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:55,623 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-09 12:52:55,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 12:52:55,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 12:52:55,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:52:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12033 backedges. 2550 proven. 32 refuted. 0 times theorem prover too weak. 9451 trivial. 0 not checked. [2020-12-09 12:52:56,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:52:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12033 backedges. 331 proven. 1489 refuted. 0 times theorem prover too weak. 10213 trivial. 0 not checked. [2020-12-09 12:52:58,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [94333231] [2020-12-09 12:52:58,210 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:52:58,211 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:52:58,211 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:52:58,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:52:58,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 27 [2020-12-09 12:52:58,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712250013] [2020-12-09 12:52:58,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-12-09 12:52:58,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:52:58,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-12-09 12:52:58,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2020-12-09 12:52:58,213 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand 27 states. [2020-12-09 12:52:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:52:58,856 INFO L93 Difference]: Finished difference Result 371 states and 752 transitions. [2020-12-09 12:52:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-09 12:52:58,857 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 640 [2020-12-09 12:52:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:52:58,858 INFO L225 Difference]: With dead ends: 371 [2020-12-09 12:52:58,858 INFO L226 Difference]: Without dead ends: 167 [2020-12-09 12:52:58,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1318 GetRequests, 1268 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2020-12-09 12:52:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-12-09 12:52:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2020-12-09 12:52:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-09 12:52:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 215 transitions. [2020-12-09 12:52:58,869 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 215 transitions. Word has length 640 [2020-12-09 12:52:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:52:58,870 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 215 transitions. [2020-12-09 12:52:58,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-12-09 12:52:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 215 transitions. [2020-12-09 12:52:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2020-12-09 12:52:58,872 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:52:58,873 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1] [2020-12-09 12:52:59,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2020-12-09 12:52:59,074 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:52:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:52:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash 734203464, now seen corresponding path program 4 times [2020-12-09 12:52:59,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:52:59,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782719743] [2020-12-09 12:52:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:52:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 554 proven. 673 refuted. 0 times theorem prover too weak. 6847 trivial. 0 not checked. [2020-12-09 12:52:59,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782719743] [2020-12-09 12:52:59,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065017074] [2020-12-09 12:52:59,421 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:52:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 12:52:59,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 12:52:59,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 12:53:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 664 proven. 866 refuted. 0 times theorem prover too weak. 6544 trivial. 0 not checked. [2020-12-09 12:53:00,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 12:53:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 664 proven. 896 refuted. 0 times theorem prover too weak. 6514 trivial. 0 not checked. [2020-12-09 12:53:02,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389182442] [2020-12-09 12:53:02,511 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2020-12-09 12:53:02,511 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 12:53:02,511 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:94) 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:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) 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) [2020-12-09 12:53:02,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 12:53:02,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 19] total 25 [2020-12-09 12:53:02,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396921024] [2020-12-09 12:53:02,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 12:53:02,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 12:53:02,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 12:53:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2020-12-09 12:53:02,513 INFO L87 Difference]: Start difference. First operand 159 states and 215 transitions. Second operand 25 states. [2020-12-09 12:53:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 12:53:02,759 INFO L93 Difference]: Finished difference Result 181 states and 252 transitions. [2020-12-09 12:53:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 12:53:02,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 527 [2020-12-09 12:53:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 12:53:02,761 INFO L225 Difference]: With dead ends: 181 [2020-12-09 12:53:02,761 INFO L226 Difference]: Without dead ends: 159 [2020-12-09 12:53:02,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1044 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 12:53:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-12-09 12:53:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-12-09 12:53:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-09 12:53:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2020-12-09 12:53:02,769 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 527 [2020-12-09 12:53:02,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 12:53:02,769 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2020-12-09 12:53:02,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 12:53:02,769 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2020-12-09 12:53:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-12-09 12:53:02,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 12:53:02,772 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2020-12-09 12:53:02,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 12:53:02,973 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 12:53:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 12:53:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1278903223, now seen corresponding path program 5 times [2020-12-09 12:53:02,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 12:53:02,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386767174] [2020-12-09 12:53:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 12:53:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 12:53:03,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 12:53:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 12:53:03,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 12:53:03,184 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 12:53:03,185 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 12:53:03,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-09 12:53:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:53:03 BoogieIcfgContainer [2020-12-09 12:53:03,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 12:53:03,297 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 12:53:03,297 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 12:53:03,297 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 12:53:03,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:52:39" (3/4) ... [2020-12-09 12:53:03,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 12:53:03,387 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_adacb088-f97e-4a42-8bf8-a92cd59f9edd/bin/utaipan/witness.graphml [2020-12-09 12:53:03,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 12:53:03,388 INFO L168 Benchmark]: Toolchain (without parser) took 24110.00 ms. Allocated memory was 102.8 MB in the beginning and 677.4 MB in the end (delta: 574.6 MB). Free memory was 62.7 MB in the beginning and 322.9 MB in the end (delta: -260.2 MB). Peak memory consumption was 315.8 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,388 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 102.8 MB. Free memory is still 78.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:53:03,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.30 ms. Allocated memory is still 102.8 MB. Free memory was 62.5 MB in the beginning and 80.9 MB in the end (delta: -18.4 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.83 ms. Allocated memory is still 102.8 MB. Free memory was 80.9 MB in the beginning and 79.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,389 INFO L168 Benchmark]: Boogie Preprocessor took 12.13 ms. Allocated memory is still 102.8 MB. Free memory was 79.5 MB in the beginning and 78.8 MB in the end (delta: 756.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 12:53:03,389 INFO L168 Benchmark]: RCFGBuilder took 229.61 ms. Allocated memory is still 102.8 MB. Free memory was 78.5 MB in the beginning and 73.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,389 INFO L168 Benchmark]: TraceAbstraction took 23602.54 ms. Allocated memory was 102.8 MB in the beginning and 677.4 MB in the end (delta: 574.6 MB). Free memory was 73.4 MB in the beginning and 342.8 MB in the end (delta: -269.4 MB). Peak memory consumption was 307.4 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,390 INFO L168 Benchmark]: Witness Printer took 89.83 ms. Allocated memory is still 677.4 MB. Free memory was 342.8 MB in the beginning and 322.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-09 12:53:03,391 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.13 ms. Allocated memory is still 102.8 MB. Free memory is still 78.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 150.30 ms. Allocated memory is still 102.8 MB. Free memory was 62.5 MB in the beginning and 80.9 MB in the end (delta: -18.4 MB). Peak memory consumption was 11.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 19.83 ms. Allocated memory is still 102.8 MB. Free memory was 80.9 MB in the beginning and 79.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 12.13 ms. Allocated memory is still 102.8 MB. Free memory was 79.5 MB in the beginning and 78.8 MB in the end (delta: 756.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 229.61 ms. Allocated memory is still 102.8 MB. Free memory was 78.5 MB in the beginning and 73.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23602.54 ms. Allocated memory was 102.8 MB in the beginning and 677.4 MB in the end (delta: 574.6 MB). Free memory was 73.4 MB in the beginning and 342.8 MB in the end (delta: -269.4 MB). Peak memory consumption was 307.4 MB. Max. memory is 16.1 GB. * Witness Printer took 89.83 ms. Allocated memory is still 677.4 MB. Free memory was 342.8 MB in the beginning and 322.9 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) [L39] int result = fibo1(x); [L40] COND TRUE result == 21 [L41] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.4s, OverallIterations: 15, TraceHistogramMax: 48, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 402 SDtfs, 954 SDslu, 2865 SDs, 0 SdLazy, 4695 SolverSat, 1067 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5408 GetRequests, 5029 SyntacticMatches, 21 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=13, 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, 14 MinimizatonAttempts, 148 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 5606 NumberOfCodeBlocks, 4932 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 7673 ConstructedInterpolants, 0 QuantifiedInterpolants, 4122097 SizeOfPredicates, 68 NumberOfNonLiveVariables, 4478 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 87553/95640 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...