./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG --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 acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1-dev-b2eff8b [2021-10-29 05:26:57,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:26:57,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:26:57,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:26:57,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:26:57,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:26:57,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:26:57,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:26:57,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:26:57,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:26:57,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:26:57,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:26:57,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:26:57,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:26:57,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:26:57,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:26:57,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:26:57,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:26:57,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:26:57,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:26:57,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:26:57,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:26:57,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:26:57,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:26:57,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:26:57,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:26:57,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:26:57,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:26:57,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:26:57,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:26:57,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:26:57,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:26:57,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:26:57,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:26:57,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:26:57,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:26:57,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:26:57,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:26:57,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:26:57,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:26:57,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:26:57,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:26:57,604 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:26:57,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:26:57,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:26:57,608 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:26:57,608 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:26:57,609 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:26:57,609 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:26:57,609 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:26:57,617 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:26:57,617 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:26:57,618 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:26:57,619 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:26:57,619 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:26:57,620 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:26:57,620 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:26:57,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:26:57,621 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:26:57,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:26:57,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:26:57,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:26:57,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:26:57,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:26:57,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:26:57,623 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:26:57,624 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:26:57,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:26:57,624 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:26:57,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:26:57,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:26:57,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:26:57,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:26:57,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:26:57,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:26:57,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:26:57,627 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:26:57,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:26:57,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:26:57,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:26:57,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:26:57,628 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_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/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_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG 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 -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2021-10-29 05:26:57,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:26:57,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:26:57,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:26:57,932 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:26:57,933 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:26:57,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-10-29 05:26:58,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/data/4e697b153/cb34a0ede42d4ce3bb7c8020b1ce3a8b/FLAG214834147 [2021-10-29 05:26:58,586 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:26:58,589 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2021-10-29 05:26:58,598 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/data/4e697b153/cb34a0ede42d4ce3bb7c8020b1ce3a8b/FLAG214834147 [2021-10-29 05:26:58,932 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/data/4e697b153/cb34a0ede42d4ce3bb7c8020b1ce3a8b [2021-10-29 05:26:58,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:26:58,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:26:58,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:26:58,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:26:58,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:26:58,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:26:58" (1/1) ... [2021-10-29 05:26:58,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dbfe246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:58, skipping insertion in model container [2021-10-29 05:26:58,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:26:58" (1/1) ... [2021-10-29 05:26:58,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:26:58,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:26:59,142 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-10-29 05:26:59,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:26:59,154 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:26:59,180 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2021-10-29 05:26:59,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:26:59,197 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:26:59,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59 WrapperNode [2021-10-29 05:26:59,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:26:59,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:26:59,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:26:59,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:26:59,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:26:59,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:26:59,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:26:59,247 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:26:59,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:26:59,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:26:59,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:26:59,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:26:59,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (1/1) ... [2021-10-29 05:26:59,283 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:26:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:26:59,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:26:59,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:26:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:26:59,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:26:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:26:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:26:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-29 05:26:59,356 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-29 05:26:59,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:26:59,632 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-29 05:26:59,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:26:59 BoogieIcfgContainer [2021-10-29 05:26:59,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:26:59,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:26:59,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:26:59,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:26:59,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:26:58" (1/3) ... [2021-10-29 05:26:59,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622829fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:26:59, skipping insertion in model container [2021-10-29 05:26:59,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:26:59" (2/3) ... [2021-10-29 05:26:59,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622829fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:26:59, skipping insertion in model container [2021-10-29 05:26:59,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:26:59" (3/3) ... [2021-10-29 05:26:59,663 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2021-10-29 05:26:59,669 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:26:59,669 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 05:26:59,733 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:26:59,741 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:26:59,741 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 05:26:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-10-29 05:26:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:26:59,769 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:26:59,770 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:26:59,770 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:26:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:26:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1688587911, now seen corresponding path program 1 times [2021-10-29 05:26:59,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:26:59,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036437984] [2021-10-29 05:26:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:26:59,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:26:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:00,039 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:00,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036437984] [2021-10-29 05:27:00,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036437984] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:00,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:00,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:27:00,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581998748] [2021-10-29 05:27:00,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:27:00,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:27:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:27:00,070 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 05:27:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:00,124 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-10-29 05:27:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:27:00,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-10-29 05:27:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:00,145 INFO L225 Difference]: With dead ends: 27 [2021-10-29 05:27:00,146 INFO L226 Difference]: Without dead ends: 17 [2021-10-29 05:27:00,150 INFO L786 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 [2021-10-29 05:27:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-29 05:27:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-29 05:27:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 05:27:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-29 05:27:00,207 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-29 05:27:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:00,209 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-29 05:27:00,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 05:27:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-29 05:27:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:27:00,221 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:00,222 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:00,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:27:00,223 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:00,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:00,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1521360425, now seen corresponding path program 1 times [2021-10-29 05:27:00,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:00,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026420920] [2021-10-29 05:27:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:00,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:27:00,325 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:00,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026420920] [2021-10-29 05:27:00,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026420920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:27:00,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:27:00,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:27:00,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620270670] [2021-10-29 05:27:00,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:27:00,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:00,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:27:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:27:00,338 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 05:27:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:00,374 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-29 05:27:00,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:27:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-10-29 05:27:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:00,377 INFO L225 Difference]: With dead ends: 23 [2021-10-29 05:27:00,378 INFO L226 Difference]: Without dead ends: 19 [2021-10-29 05:27:00,380 INFO L786 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 [2021-10-29 05:27:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-29 05:27:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-29 05:27:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 05:27:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-29 05:27:00,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-29 05:27:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:00,396 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-29 05:27:00,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-10-29 05:27:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-29 05:27:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:27:00,397 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:00,398 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:00,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:27:00,398 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:00,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1124411740, now seen corresponding path program 1 times [2021-10-29 05:27:00,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:00,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610455549] [2021-10-29 05:27:00,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:00,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:27:00,525 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:00,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610455549] [2021-10-29 05:27:00,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610455549] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:00,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426180546] [2021-10-29 05:27:00,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:00,529 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:00,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:00,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:00,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 05:27:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:00,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:27:00,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:27:00,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 05:27:01,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426180546] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:01,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [379761283] [2021-10-29 05:27:01,066 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:01,066 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:01,082 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:01,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:01,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-10-29 05:27:01,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167903066] [2021-10-29 05:27:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 05:27:01,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:01,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 05:27:01,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:27:01,091 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-29 05:27:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:01,209 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-29 05:27:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:27:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2021-10-29 05:27:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:01,213 INFO L225 Difference]: With dead ends: 34 [2021-10-29 05:27:01,213 INFO L226 Difference]: Without dead ends: 19 [2021-10-29 05:27:01,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-29 05:27:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-29 05:27:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-29 05:27:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-29 05:27:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-29 05:27:01,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-10-29 05:27:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:01,229 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-29 05:27:01,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.375) internal successors, (27), 11 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2021-10-29 05:27:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-10-29 05:27:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:27:01,237 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:01,237 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:01,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:01,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:01,450 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash 992661418, now seen corresponding path program 1 times [2021-10-29 05:27:01,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:01,451 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799463894] [2021-10-29 05:27:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:01,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:27:01,559 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:01,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799463894] [2021-10-29 05:27:01,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799463894] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:01,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667096667] [2021-10-29 05:27:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:01,560 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:01,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:01,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 05:27:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:01,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:27:01,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-29 05:27:01,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-29 05:27:02,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667096667] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:02,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1949692054] [2021-10-29 05:27:02,076 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:02,076 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:02,077 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:02,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:02,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-29 05:27:02,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391048118] [2021-10-29 05:27:02,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 05:27:02,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 05:27:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:27:02,084 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-29 05:27:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:02,171 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-10-29 05:27:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:27:02,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 23 [2021-10-29 05:27:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:02,179 INFO L225 Difference]: With dead ends: 28 [2021-10-29 05:27:02,180 INFO L226 Difference]: Without dead ends: 24 [2021-10-29 05:27:02,181 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:27:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-29 05:27:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-29 05:27:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-29 05:27:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-29 05:27:02,198 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-10-29 05:27:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:02,199 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-29 05:27:02,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-29 05:27:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-29 05:27:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:27:02,204 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:02,204 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:02,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:02,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:02,417 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:02,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1950959585, now seen corresponding path program 2 times [2021-10-29 05:27:02,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:02,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236576447] [2021-10-29 05:27:02,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:02,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-29 05:27:02,614 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:02,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236576447] [2021-10-29 05:27:02,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236576447] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:02,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975880721] [2021-10-29 05:27:02,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:27:02,618 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:02,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:02,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 05:27:02,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-29 05:27:02,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:02,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-29 05:27:02,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 05:27:02,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:27:03,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975880721] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:03,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [663292782] [2021-10-29 05:27:03,254 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:03,254 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:03,254 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:03,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:03,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-10-29 05:27:03,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698260928] [2021-10-29 05:27:03,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-29 05:27:03,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-29 05:27:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:27:03,257 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-29 05:27:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:03,503 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-10-29 05:27:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:27:03,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 36 [2021-10-29 05:27:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:03,506 INFO L225 Difference]: With dead ends: 55 [2021-10-29 05:27:03,507 INFO L226 Difference]: Without dead ends: 33 [2021-10-29 05:27:03,509 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-29 05:27:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-29 05:27:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-10-29 05:27:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2021-10-29 05:27:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-10-29 05:27:03,517 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-10-29 05:27:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:03,518 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-10-29 05:27:03,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 7 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2021-10-29 05:27:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-10-29 05:27:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-29 05:27:03,520 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:03,520 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:03,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:03,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:03,742 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1865467761, now seen corresponding path program 3 times [2021-10-29 05:27:03,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:03,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350138071] [2021-10-29 05:27:03,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:03,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:27:03,832 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:03,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350138071] [2021-10-29 05:27:03,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350138071] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:03,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463680106] [2021-10-29 05:27:03,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:27:03,832 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:03,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:03,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:03,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 05:27:03,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:27:03,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:03,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:27:03,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-29 05:27:04,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-29 05:27:04,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463680106] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:04,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1363371506] [2021-10-29 05:27:04,539 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:04,540 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:04,540 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:04,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:04,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-29 05:27:04,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102735398] [2021-10-29 05:27:04,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 05:27:04,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 05:27:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-29 05:27:04,545 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2021-10-29 05:27:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:04,642 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-10-29 05:27:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:27:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2021-10-29 05:27:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:04,644 INFO L225 Difference]: With dead ends: 36 [2021-10-29 05:27:04,645 INFO L226 Difference]: Without dead ends: 32 [2021-10-29 05:27:04,645 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:27:04,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-29 05:27:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-29 05:27:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2021-10-29 05:27:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-10-29 05:27:04,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-10-29 05:27:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:04,656 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-10-29 05:27:04,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 11 states have internal predecessors, (30), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 3 states have call predecessors, (8), 7 states have call successors, (8) [2021-10-29 05:27:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-10-29 05:27:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-29 05:27:04,660 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:04,660 INFO L513 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:04,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:04,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:04,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1351422375, now seen corresponding path program 4 times [2021-10-29 05:27:04,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:04,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896599414] [2021-10-29 05:27:04,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:04,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-10-29 05:27:05,050 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:05,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896599414] [2021-10-29 05:27:05,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896599414] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:05,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184079395] [2021-10-29 05:27:05,055 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:27:05,056 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:05,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:05,057 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:05,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-29 05:27:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:05,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-29 05:27:05,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-10-29 05:27:05,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-10-29 05:27:06,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184079395] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:06,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1853328469] [2021-10-29 05:27:06,216 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:06,216 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:06,217 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:06,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:06,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-29 05:27:06,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915146592] [2021-10-29 05:27:06,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 05:27:06,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:06,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 05:27:06,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:27:06,219 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2021-10-29 05:27:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:06,359 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-10-29 05:27:06,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:27:06,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 64 [2021-10-29 05:27:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:06,366 INFO L225 Difference]: With dead ends: 41 [2021-10-29 05:27:06,367 INFO L226 Difference]: Without dead ends: 37 [2021-10-29 05:27:06,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:27:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-29 05:27:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-29 05:27:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2021-10-29 05:27:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-10-29 05:27:06,399 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 64 [2021-10-29 05:27:06,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:06,400 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-10-29 05:27:06,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 13 states have internal predecessors, (39), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2021-10-29 05:27:06,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-10-29 05:27:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2021-10-29 05:27:06,428 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:06,428 INFO L513 BasicCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:06,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:06,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:06,629 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:06,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:06,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1437906103, now seen corresponding path program 5 times [2021-10-29 05:27:06,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:06,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141445485] [2021-10-29 05:27:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:06,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 91 proven. 567 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2021-10-29 05:27:06,933 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:06,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141445485] [2021-10-29 05:27:06,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141445485] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:06,934 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192566416] [2021-10-29 05:27:06,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:27:06,934 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:06,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:06,935 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:06,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-29 05:27:07,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-29 05:27:07,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:07,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 05:27:07,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 712 proven. 16 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2021-10-29 05:27:07,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 588 proven. 34 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2021-10-29 05:27:09,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192566416] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:09,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1501610963] [2021-10-29 05:27:09,061 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:09,062 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:09,062 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java: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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:09,063 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:09,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2021-10-29 05:27:09,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447113640] [2021-10-29 05:27:09,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-29 05:27:09,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-29 05:27:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-29 05:27:09,067 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-29 05:27:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:09,568 INFO L93 Difference]: Finished difference Result 94 states and 191 transitions. [2021-10-29 05:27:09,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-29 05:27:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) Word has length 202 [2021-10-29 05:27:09,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:09,572 INFO L225 Difference]: With dead ends: 94 [2021-10-29 05:27:09,572 INFO L226 Difference]: Without dead ends: 58 [2021-10-29 05:27:09,576 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 399 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2021-10-29 05:27:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-10-29 05:27:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-10-29 05:27:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 39 states have internal predecessors, (46), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (22), 11 states have call predecessors, (22), 10 states have call successors, (22) [2021-10-29 05:27:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2021-10-29 05:27:09,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 202 [2021-10-29 05:27:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:09,590 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2021-10-29 05:27:09,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 16 states have internal predecessors, (55), 11 states have call successors, (16), 2 states have call predecessors, (16), 9 states have return successors, (22), 10 states have call predecessors, (22), 11 states have call successors, (22) [2021-10-29 05:27:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2021-10-29 05:27:09,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-10-29 05:27:09,594 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:09,594 INFO L513 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:09,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:09,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:09,817 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:09,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1858393177, now seen corresponding path program 6 times [2021-10-29 05:27:09,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:09,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553621212] [2021-10-29 05:27:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:09,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-29 05:27:09,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:09,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553621212] [2021-10-29 05:27:09,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553621212] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:09,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618648419] [2021-10-29 05:27:09,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:27:09,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:09,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:09,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:10,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-29 05:27:10,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:27:10,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:10,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 05:27:10,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-29 05:27:10,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2021-10-29 05:27:12,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618648419] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:12,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1353012287] [2021-10-29 05:27:12,692 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:12,692 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:12,692 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:12,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:12,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2021-10-29 05:27:12,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417852856] [2021-10-29 05:27:12,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-29 05:27:12,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-29 05:27:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-10-29 05:27:12,695 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2021-10-29 05:27:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:12,905 INFO L93 Difference]: Finished difference Result 67 states and 95 transitions. [2021-10-29 05:27:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 05:27:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 173 [2021-10-29 05:27:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:12,909 INFO L225 Difference]: With dead ends: 67 [2021-10-29 05:27:12,909 INFO L226 Difference]: Without dead ends: 63 [2021-10-29 05:27:12,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2021-10-29 05:27:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-29 05:27:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-29 05:27:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 42 states have internal predecessors, (49), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (30), 13 states have call predecessors, (30), 11 states have call successors, (30) [2021-10-29 05:27:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2021-10-29 05:27:12,922 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 173 [2021-10-29 05:27:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:12,923 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2021-10-29 05:27:12,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.4) internal successors, (51), 17 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2021-10-29 05:27:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2021-10-29 05:27:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-10-29 05:27:12,929 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:12,930 INFO L513 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:12,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:13,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:13,157 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1234663993, now seen corresponding path program 7 times [2021-10-29 05:27:13,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:13,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720900130] [2021-10-29 05:27:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:13,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-10-29 05:27:13,442 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:13,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720900130] [2021-10-29 05:27:13,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720900130] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:13,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296421504] [2021-10-29 05:27:13,443 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-29 05:27:13,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:13,444 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:13,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-29 05:27:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:14,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-29 05:27:14,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-10-29 05:27:14,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2021-10-29 05:27:17,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296421504] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:17,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [122632499] [2021-10-29 05:27:17,301 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:17,302 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:17,302 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:17,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:17,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2021-10-29 05:27:17,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937233950] [2021-10-29 05:27:17,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-29 05:27:17,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-29 05:27:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-10-29 05:27:17,307 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2021-10-29 05:27:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:17,506 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2021-10-29 05:27:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 05:27:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 282 [2021-10-29 05:27:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:17,509 INFO L225 Difference]: With dead ends: 72 [2021-10-29 05:27:17,509 INFO L226 Difference]: Without dead ends: 68 [2021-10-29 05:27:17,510 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2021-10-29 05:27:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-29 05:27:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-29 05:27:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 45 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (40), 15 states have call predecessors, (40), 12 states have call successors, (40) [2021-10-29 05:27:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2021-10-29 05:27:17,524 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 282 [2021-10-29 05:27:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:17,525 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2021-10-29 05:27:17,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 19 states have internal predecessors, (57), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2021-10-29 05:27:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2021-10-29 05:27:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2021-10-29 05:27:17,544 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:17,544 INFO L513 BasicCegarLoop]: trace histogram [89, 89, 71, 44, 44, 44, 44, 44, 44, 44, 27, 18, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:17,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:17,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-29 05:27:17,769 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1790718179, now seen corresponding path program 8 times [2021-10-29 05:27:17,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:17,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557889759] [2021-10-29 05:27:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:17,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 493 proven. 3110 refuted. 0 times theorem prover too weak. 18330 trivial. 0 not checked. [2021-10-29 05:27:18,215 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:18,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557889759] [2021-10-29 05:27:18,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557889759] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:18,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160909570] [2021-10-29 05:27:18,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-29 05:27:18,219 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:18,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:18,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:18,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-29 05:27:19,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-10-29 05:27:19,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:19,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 12 conjunts are in the unsatisfiable core [2021-10-29 05:27:19,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:20,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 71 refuted. 0 times theorem prover too weak. 19191 trivial. 0 not checked. [2021-10-29 05:27:20,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2671 proven. 77 refuted. 0 times theorem prover too weak. 19185 trivial. 0 not checked. [2021-10-29 05:27:24,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160909570] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:24,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1702586849] [2021-10-29 05:27:24,055 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:24,056 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:24,057 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:24,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:24,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 23 [2021-10-29 05:27:24,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102996470] [2021-10-29 05:27:24,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 05:27:24,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:24,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 05:27:24,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-10-29 05:27:24,067 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2021-10-29 05:27:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:24,997 INFO L93 Difference]: Finished difference Result 169 states and 326 transitions. [2021-10-29 05:27:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-10-29 05:27:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) Word has length 608 [2021-10-29 05:27:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:25,001 INFO L225 Difference]: With dead ends: 169 [2021-10-29 05:27:25,001 INFO L226 Difference]: Without dead ends: 107 [2021-10-29 05:27:25,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1264 GetRequests, 1210 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=691, Invalid=2171, Unknown=0, NotChecked=0, Total=2862 [2021-10-29 05:27:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-10-29 05:27:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2021-10-29 05:27:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 66 states have internal predecessors, (76), 17 states have call successors, (17), 14 states have call predecessors, (17), 10 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2021-10-29 05:27:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2021-10-29 05:27:25,033 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 608 [2021-10-29 05:27:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:25,035 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2021-10-29 05:27:25,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.272727272727273) internal successors, (72), 23 states have internal predecessors, (72), 16 states have call successors, (22), 1 states have call predecessors, (22), 14 states have return successors, (32), 16 states have call predecessors, (32), 16 states have call successors, (32) [2021-10-29 05:27:25,036 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2021-10-29 05:27:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2021-10-29 05:27:25,074 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:25,074 INFO L513 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:25,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:25,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:25,293 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1534963906, now seen corresponding path program 9 times [2021-10-29 05:27:25,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:25,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756414944] [2021-10-29 05:27:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:25,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:27:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2021-10-29 05:27:25,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:27:25,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756414944] [2021-10-29 05:27:25,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756414944] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:27:25,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647831399] [2021-10-29 05:27:25,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-29 05:27:25,892 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:25,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:27:25,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:27:25,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-29 05:27:27,182 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-29 05:27:27,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-29 05:27:27,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 1640 conjuncts, 34 conjunts are in the unsatisfiable core [2021-10-29 05:27:27,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:27:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7472 refuted. 0 times theorem prover too weak. 39653 trivial. 0 not checked. [2021-10-29 05:27:29,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:27:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3785 proven. 7619 refuted. 0 times theorem prover too weak. 39506 trivial. 0 not checked. [2021-10-29 05:27:38,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647831399] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-29 05:27:38,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1289050730] [2021-10-29 05:27:38,063 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-29 05:27:38,063 INFO L166 IcfgInterpreter]: Building call graph [2021-10-29 05:27:38,064 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:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-10-29 05:27:38,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-29 05:27:38,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 35] total 39 [2021-10-29 05:27:38,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438662280] [2021-10-29 05:27:38,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-10-29 05:27:38,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:27:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-10-29 05:27:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2021-10-29 05:27:38,072 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2021-10-29 05:27:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:27:39,799 INFO L93 Difference]: Finished difference Result 245 states and 492 transitions. [2021-10-29 05:27:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-29 05:27:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) Word has length 922 [2021-10-29 05:27:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:27:39,809 INFO L225 Difference]: With dead ends: 245 [2021-10-29 05:27:39,809 INFO L226 Difference]: Without dead ends: 153 [2021-10-29 05:27:39,814 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1899 GetRequests, 1824 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1293, Invalid=4257, Unknown=0, NotChecked=0, Total=5550 [2021-10-29 05:27:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-10-29 05:27:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2021-10-29 05:27:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 93 states have internal predecessors, (97), 27 states have call successors, (27), 21 states have call predecessors, (27), 11 states have return successors, (75), 19 states have call predecessors, (75), 27 states have call successors, (75) [2021-10-29 05:27:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2021-10-29 05:27:39,865 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2021-10-29 05:27:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:27:39,870 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2021-10-29 05:27:39,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.1315789473684212) internal successors, (119), 39 states have internal predecessors, (119), 34 states have call successors, (36), 1 states have call predecessors, (36), 19 states have return successors, (50), 18 states have call predecessors, (50), 34 states have call successors, (50) [2021-10-29 05:27:39,871 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2021-10-29 05:27:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2021-10-29 05:27:39,987 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:27:39,988 INFO L513 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2021-10-29 05:27:40,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-29 05:27:40,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:27:40,213 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:27:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:27:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1152068023, now seen corresponding path program 10 times [2021-10-29 05:27:40,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:27:40,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500539293] [2021-10-29 05:27:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:27:40,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:27:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:27:40,989 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:27:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:27:42,335 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:27:42,335 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:27:42,337 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:27:42,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:27:42,347 INFO L731 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2021-10-29 05:27:42,355 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:27:42,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:27:42 BoogieIcfgContainer [2021-10-29 05:27:42,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:27:42,764 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:27:42,764 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:27:42,764 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:27:42,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:26:59" (3/4) ... [2021-10-29 05:27:42,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:27:43,133 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:27:43,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:27:43,136 INFO L168 Benchmark]: Toolchain (without parser) took 44197.12 ms. Allocated memory was 102.8 MB in the beginning and 375.4 MB in the end (delta: 272.6 MB). Free memory was 70.0 MB in the beginning and 212.1 MB in the end (delta: -142.1 MB). Peak memory consumption was 205.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,136 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 102.8 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:27:43,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.12 ms. Allocated memory is still 102.8 MB. Free memory was 69.8 MB in the beginning and 79.5 MB in the end (delta: -9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.94 ms. Allocated memory is still 102.8 MB. Free memory was 79.5 MB in the beginning and 78.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:27:43,138 INFO L168 Benchmark]: Boogie Preprocessor took 24.23 ms. Allocated memory is still 102.8 MB. Free memory was 78.3 MB in the beginning and 77.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,138 INFO L168 Benchmark]: RCFGBuilder took 364.75 ms. Allocated memory is still 102.8 MB. Free memory was 77.1 MB in the beginning and 67.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,139 INFO L168 Benchmark]: TraceAbstraction took 43126.10 ms. Allocated memory was 102.8 MB in the beginning and 297.8 MB in the end (delta: 195.0 MB). Free memory was 67.0 MB in the beginning and 80.3 MB in the end (delta: -13.3 MB). Peak memory consumption was 210.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,140 INFO L168 Benchmark]: Witness Printer took 370.02 ms. Allocated memory was 297.8 MB in the beginning and 375.4 MB in the end (delta: 77.6 MB). Free memory was 80.3 MB in the beginning and 212.1 MB in the end (delta: -131.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:27:43,142 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.34 ms. Allocated memory is still 102.8 MB. Free memory is still 58.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 259.12 ms. Allocated memory is still 102.8 MB. Free memory was 69.8 MB in the beginning and 79.5 MB in the end (delta: -9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.94 ms. Allocated memory is still 102.8 MB. Free memory was 79.5 MB in the beginning and 78.3 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.23 ms. Allocated memory is still 102.8 MB. Free memory was 78.3 MB in the beginning and 77.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 364.75 ms. Allocated memory is still 102.8 MB. Free memory was 77.1 MB in the beginning and 67.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 43126.10 ms. Allocated memory was 102.8 MB in the beginning and 297.8 MB in the end (delta: 195.0 MB). Free memory was 67.0 MB in the beginning and 80.3 MB in the end (delta: -13.3 MB). Peak memory consumption was 210.1 MB. Max. memory is 16.1 GB. * Witness Printer took 370.02 ms. Allocated memory was 297.8 MB in the beginning and 375.4 MB in the end (delta: 77.6 MB). Free memory was 80.3 MB in the beginning and 212.1 MB in the end (delta: -131.8 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 13, TraceHistogramMax: 177, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.2s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 1345 SDslu, 759 SDs, 0 SdLazy, 1727 SolverSat, 2193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4977 GetRequests, 4692 SyntacticMatches, 12 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=12, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 36 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 5965 NumberOfCodeBlocks, 5176 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 7094 ConstructedInterpolants, 0 QuantifiedInterpolants, 9818 SizeOfPredicates, 50 NumberOfNonLiveVariables, 3693 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 214899/244992 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! [2021-10-29 05:27:43,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_824058fb-0e09-4df1-9b66-acc736d9914d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...