./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI --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 b2c28e4a28eb31322d66c263b5716511ec5353f2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:24:59,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:24:59,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:25:00,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:25:00,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:25:00,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:25:00,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:25:00,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:25:00,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:25:00,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:25:00,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:25:00,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:25:00,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:25:00,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:25:00,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:25:00,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:25:00,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:25:00,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:25:00,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:25:00,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:25:00,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:25:00,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:25:00,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:25:00,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:25:00,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:25:00,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:25:00,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:25:00,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:25:00,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:25:00,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:25:00,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:25:00,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:25:00,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:25:00,089 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:25:00,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:25:00,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:25:00,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:25:00,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:25:00,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:25:00,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:25:00,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:25:00,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:25:00,144 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:25:00,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:25:00,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:25:00,146 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:25:00,146 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:25:00,146 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:25:00,146 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:25:00,147 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:25:00,147 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:25:00,147 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:25:00,148 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:25:00,148 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:25:00,149 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:25:00,149 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:25:00,149 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:25:00,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:25:00,150 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:25:00,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:25:00,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:25:00,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:25:00,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:25:00,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:25:00,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:25:00,151 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:25:00,151 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:25:00,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:25:00,152 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:25:00,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:25:00,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:25:00,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:25:00,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:25:00,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:25:00,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:25:00,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:25:00,155 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:25:00,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:25:00,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:25:00,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:25:00,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:25:00,156 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_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/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_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI 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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2021-10-11 02:25:00,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:25:00,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:25:00,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:25:00,546 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:25:00,547 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:25:00,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-10-11 02:25:00,607 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/data/11a576b18/754d009733c4412bbaac763ea1731b32/FLAG296982d5c [2021-10-11 02:25:01,040 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:25:01,041 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2021-10-11 02:25:01,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/data/11a576b18/754d009733c4412bbaac763ea1731b32/FLAG296982d5c [2021-10-11 02:25:01,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/data/11a576b18/754d009733c4412bbaac763ea1731b32 [2021-10-11 02:25:01,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:25:01,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:25:01,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:25:01,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:25:01,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:25:01,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b297aba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01, skipping insertion in model container [2021-10-11 02:25:01,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:25:01,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:25:01,659 WARN L226 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_e13c488a-2292-41fe-917e-2d6873dda03e/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-10-11 02:25:01,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:25:01,684 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:25:01,703 WARN L226 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_e13c488a-2292-41fe-917e-2d6873dda03e/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2021-10-11 02:25:01,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:25:01,720 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:25:01,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01 WrapperNode [2021-10-11 02:25:01,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:25:01,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:25:01,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:25:01,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:25:01,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:25:01,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:25:01,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:25:01,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:25:01,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... [2021-10-11 02:25:01,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:25:01,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:25:01,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:25:01,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:25:01,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:25:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:25:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:25:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:25:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:25:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2021-10-11 02:25:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2021-10-11 02:25:02,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:25:02,264 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 02:25:02,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:02 BoogieIcfgContainer [2021-10-11 02:25:02,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:25:02,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:25:02,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:25:02,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:25:02,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:25:01" (1/3) ... [2021-10-11 02:25:02,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3f0fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:02, skipping insertion in model container [2021-10-11 02:25:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:25:01" (2/3) ... [2021-10-11 02:25:02,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3f0fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:25:02, skipping insertion in model container [2021-10-11 02:25:02,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:02" (3/3) ... [2021-10-11 02:25:02,277 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2021-10-11 02:25:02,290 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:25:02,293 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-10-11 02:25:02,304 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-11 02:25:02,328 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:25:02,329 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:25:02,329 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:25:02,329 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:25:02,329 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:25:02,329 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:25:02,330 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:25:02,330 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:25:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2021-10-11 02:25:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 02:25:02,357 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,358 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash -798924922, now seen corresponding path program 1 times [2021-10-11 02:25:02,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961346412] [2021-10-11 02:25:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,621 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-11 02:25:02,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961346412] [2021-10-11 02:25:02,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:02,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613209459] [2021-10-11 02:25:02,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:25:02,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:25:02,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,651 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2021-10-11 02:25:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,751 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-10-11 02:25:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:02,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2021-10-11 02:25:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,764 INFO L225 Difference]: With dead ends: 27 [2021-10-11 02:25:02,764 INFO L226 Difference]: Without dead ends: 17 [2021-10-11 02:25:02,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-10-11 02:25:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-10-11 02:25:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:25:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:25:02,813 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2021-10-11 02:25:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,814 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:25:02,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:25:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:25:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:25:02,817 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:25:02,817 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1717873930, now seen corresponding path program 1 times [2021-10-11 02:25:02,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753153703] [2021-10-11 02:25:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:02,897 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-11 02:25:02,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753153703] [2021-10-11 02:25:02,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:25:02,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:25:02,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446738972] [2021-10-11 02:25:02,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:25:02,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:02,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:25:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,904 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2021-10-11 02:25:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:02,942 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2021-10-11 02:25:02,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:25:02,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-10-11 02:25:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:02,947 INFO L225 Difference]: With dead ends: 23 [2021-10-11 02:25:02,948 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:25:02,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:25:02,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:25:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-10-11 02:25:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-10-11 02:25:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-10-11 02:25:02,962 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2021-10-11 02:25:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:02,963 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-10-11 02:25:02,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:25:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-10-11 02:25:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 02:25:02,965 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:02,965 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:02,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:25:02,966 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 913644549, now seen corresponding path program 1 times [2021-10-11 02:25:02,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:02,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186772465] [2021-10-11 02:25:02,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:03,084 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-11 02:25:03,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186772465] [2021-10-11 02:25:03,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061438132] [2021-10-11 02:25:03,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:03,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:25:03,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:03,423 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-11 02:25:03,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:03,777 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-11 02:25:03,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [854070427] [2021-10-11 02:25:03,797 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:03,797 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:03,803 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:03,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:03,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2021-10-11 02:25:03,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601757337] [2021-10-11 02:25:03,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:25:03,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:25:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:03,808 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 11 states. [2021-10-11 02:25:03,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:03,970 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-10-11 02:25:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:25:03,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2021-10-11 02:25:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:03,974 INFO L225 Difference]: With dead ends: 34 [2021-10-11 02:25:03,974 INFO L226 Difference]: Without dead ends: 19 [2021-10-11 02:25:03,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:25:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-10-11 02:25:03,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-10-11 02:25:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-10-11 02:25:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-10-11 02:25:03,988 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2021-10-11 02:25:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:03,988 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-10-11 02:25:03,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:25:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-10-11 02:25:03,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:25:03,991 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:03,991 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:04,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-11 02:25:04,192 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:04,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:04,192 INFO L82 PathProgramCache]: Analyzing trace with hash -252103063, now seen corresponding path program 1 times [2021-10-11 02:25:04,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:04,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418232965] [2021-10-11 02:25:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:04,260 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-11 02:25:04,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418232965] [2021-10-11 02:25:04,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712945242] [2021-10-11 02:25:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:04,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:25:04,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:04,401 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-11 02:25:04,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:04,599 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-11 02:25:04,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [597667034] [2021-10-11 02:25:04,602 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:04,602 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:04,603 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:04,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:04,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2021-10-11 02:25:04,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355175713] [2021-10-11 02:25:04,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:25:04,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:25:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:25:04,606 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2021-10-11 02:25:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:04,701 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2021-10-11 02:25:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:25:04,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2021-10-11 02:25:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:04,707 INFO L225 Difference]: With dead ends: 28 [2021-10-11 02:25:04,708 INFO L226 Difference]: Without dead ends: 24 [2021-10-11 02:25:04,708 INFO L677 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-11 02:25:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-11 02:25:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-11 02:25:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-10-11 02:25:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-10-11 02:25:04,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2021-10-11 02:25:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:04,725 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-10-11 02:25:04,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:25:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-10-11 02:25:04,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-11 02:25:04,728 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:04,728 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:04,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:04,949 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash 659330, now seen corresponding path program 2 times [2021-10-11 02:25:04,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:04,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134340702] [2021-10-11 02:25:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:05,099 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-11 02:25:05,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134340702] [2021-10-11 02:25:05,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306434556] [2021-10-11 02:25:05,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:05,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-10-11 02:25:05,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:05,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-11 02:25:05,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:05,253 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-11 02:25:05,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:05,478 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-11 02:25:05,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480562280] [2021-10-11 02:25:05,486 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:05,487 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:05,491 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:05,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:05,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 14 [2021-10-11 02:25:05,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248749313] [2021-10-11 02:25:05,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:25:05,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:05,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:25:05,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:25:05,512 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 14 states. [2021-10-11 02:25:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:05,745 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2021-10-11 02:25:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:25:05,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2021-10-11 02:25:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:05,751 INFO L225 Difference]: With dead ends: 55 [2021-10-11 02:25:05,751 INFO L226 Difference]: Without dead ends: 33 [2021-10-11 02:25:05,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:25:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-10-11 02:25:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2021-10-11 02:25:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-10-11 02:25:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-10-11 02:25:05,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 36 [2021-10-11 02:25:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:05,777 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-10-11 02:25:05,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:25:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-10-11 02:25:05,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 02:25:05,779 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:05,779 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:05,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:05,980 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2099733774, now seen corresponding path program 3 times [2021-10-11 02:25:05,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:05,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437173358] [2021-10-11 02:25:05,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:06,083 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-11 02:25:06,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437173358] [2021-10-11 02:25:06,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665985396] [2021-10-11 02:25:06,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:06,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:25:06,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:06,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:25:06,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:06,214 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-11 02:25:06,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:06,505 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-11 02:25:06,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1700353049] [2021-10-11 02:25:06,510 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:06,510 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:06,510 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:06,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:06,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2021-10-11 02:25:06,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707427107] [2021-10-11 02:25:06,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 02:25:06,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:06,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 02:25:06,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 02:25:06,514 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2021-10-11 02:25:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:06,630 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2021-10-11 02:25:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:25:06,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2021-10-11 02:25:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:06,636 INFO L225 Difference]: With dead ends: 36 [2021-10-11 02:25:06,636 INFO L226 Difference]: Without dead ends: 32 [2021-10-11 02:25:06,638 INFO L677 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-11 02:25:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-11 02:25:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-11 02:25:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:25:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2021-10-11 02:25:06,655 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 37 [2021-10-11 02:25:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:06,656 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2021-10-11 02:25:06,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 02:25:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2021-10-11 02:25:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-11 02:25:06,669 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:06,669 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:06,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:06,885 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:06,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:06,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1019643787, now seen corresponding path program 4 times [2021-10-11 02:25:06,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:06,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313429359] [2021-10-11 02:25:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:25:07,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313429359] [2021-10-11 02:25:07,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217066579] [2021-10-11 02:25:07,021 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:07,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-11 02:25:07,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-11 02:25:07,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 142 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2021-10-11 02:25:07,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733138589] [2021-10-11 02:25:07,734 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:07,735 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:07,735 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:07,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:07,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2021-10-11 02:25:07,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202887565] [2021-10-11 02:25:07,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:25:07,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:25:07,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:25:07,738 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 13 states. [2021-10-11 02:25:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:07,924 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2021-10-11 02:25:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 02:25:07,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2021-10-11 02:25:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:07,926 INFO L225 Difference]: With dead ends: 41 [2021-10-11 02:25:07,926 INFO L226 Difference]: Without dead ends: 37 [2021-10-11 02:25:07,927 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 154 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-11 02:25:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-10-11 02:25:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-10-11 02:25:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2021-10-11 02:25:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2021-10-11 02:25:07,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 78 [2021-10-11 02:25:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:07,936 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2021-10-11 02:25:07,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:25:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2021-10-11 02:25:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-11 02:25:07,938 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:07,938 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:08,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-11 02:25:08,165 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1696376591, now seen corresponding path program 5 times [2021-10-11 02:25:08,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:08,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436361345] [2021-10-11 02:25:08,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2021-10-11 02:25:08,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436361345] [2021-10-11 02:25:08,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664819715] [2021-10-11 02:25:08,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:08,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-11 02:25:08,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:08,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-11 02:25:08,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2021-10-11 02:25:08,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2021-10-11 02:25:08,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142707281] [2021-10-11 02:25:08,986 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:08,986 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:08,987 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:08,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:08,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 13 [2021-10-11 02:25:08,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105302219] [2021-10-11 02:25:08,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-10-11 02:25:08,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-11 02:25:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-10-11 02:25:08,992 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand 13 states. [2021-10-11 02:25:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:09,149 INFO L93 Difference]: Finished difference Result 46 states and 78 transitions. [2021-10-11 02:25:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:25:09,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2021-10-11 02:25:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:09,151 INFO L225 Difference]: With dead ends: 46 [2021-10-11 02:25:09,151 INFO L226 Difference]: Without dead ends: 42 [2021-10-11 02:25:09,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:25:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-10-11 02:25:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-10-11 02:25:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 02:25:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2021-10-11 02:25:09,161 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 105 [2021-10-11 02:25:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:09,162 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2021-10-11 02:25:09,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-10-11 02:25:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2021-10-11 02:25:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-10-11 02:25:09,166 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:09,166 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 30, 17, 17, 17, 17, 17, 17, 17, 13, 5, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:09,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:09,393 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -860646155, now seen corresponding path program 6 times [2021-10-11 02:25:09,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:09,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067633841] [2021-10-11 02:25:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 153 proven. 813 refuted. 0 times theorem prover too weak. 2393 trivial. 0 not checked. [2021-10-11 02:25:09,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067633841] [2021-10-11 02:25:09,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163057589] [2021-10-11 02:25:09,686 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:09,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-11 02:25:09,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:09,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-11 02:25:09,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:10,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 1748 proven. 170 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2021-10-11 02:25:10,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 294 proven. 953 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2021-10-11 02:25:11,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430986200] [2021-10-11 02:25:11,745 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:11,745 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:11,746 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:11,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:11,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 21 [2021-10-11 02:25:11,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179122514] [2021-10-11 02:25:11,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:25:11,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:25:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:25:11,752 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand 21 states. [2021-10-11 02:25:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:12,343 INFO L93 Difference]: Finished difference Result 105 states and 237 transitions. [2021-10-11 02:25:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-11 02:25:12,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 243 [2021-10-11 02:25:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:12,350 INFO L225 Difference]: With dead ends: 105 [2021-10-11 02:25:12,350 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:25:12,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 478 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=427, Invalid=1133, Unknown=0, NotChecked=0, Total=1560 [2021-10-11 02:25:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:25:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:25:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:25:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2021-10-11 02:25:12,380 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 243 [2021-10-11 02:25:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:12,381 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2021-10-11 02:25:12,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:25:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2021-10-11 02:25:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2021-10-11 02:25:12,387 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:12,387 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:12,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:12,613 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:12,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 826064675, now seen corresponding path program 7 times [2021-10-11 02:25:12,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:12,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773734498] [2021-10-11 02:25:12,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 869 proven. 346 refuted. 0 times theorem prover too weak. 4824 trivial. 0 not checked. [2021-10-11 02:25:12,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773734498] [2021-10-11 02:25:12,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527360146] [2021-10-11 02:25:12,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:13,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-11 02:25:13,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 467 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2021-10-11 02:25:13,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1091 proven. 518 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2021-10-11 02:25:15,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118651613] [2021-10-11 02:25:15,566 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:15,566 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:15,566 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:15,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:15,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 21 [2021-10-11 02:25:15,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87223955] [2021-10-11 02:25:15,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-10-11 02:25:15,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-11 02:25:15,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2021-10-11 02:25:15,574 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 21 states. [2021-10-11 02:25:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:15,808 INFO L93 Difference]: Finished difference Result 127 states and 206 transitions. [2021-10-11 02:25:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:25:15,809 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 323 [2021-10-11 02:25:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:15,813 INFO L225 Difference]: With dead ends: 127 [2021-10-11 02:25:15,814 INFO L226 Difference]: Without dead ends: 100 [2021-10-11 02:25:15,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2021-10-11 02:25:15,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-11 02:25:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2021-10-11 02:25:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-10-11 02:25:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2021-10-11 02:25:15,847 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 323 [2021-10-11 02:25:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:15,848 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2021-10-11 02:25:15,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2021-10-11 02:25:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2021-10-11 02:25:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2021-10-11 02:25:15,855 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:15,855 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:16,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 02:25:16,081 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:16,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1304661205, now seen corresponding path program 8 times [2021-10-11 02:25:16,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:16,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166463644] [2021-10-11 02:25:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:25:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 316 proven. 1151 refuted. 0 times theorem prover too weak. 3580 trivial. 0 not checked. [2021-10-11 02:25:16,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166463644] [2021-10-11 02:25:16,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040903291] [2021-10-11 02:25:16,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:16,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-10-11 02:25:16,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-11 02:25:16,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-11 02:25:16,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:25:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 328 proven. 1133 refuted. 0 times theorem prover too weak. 3586 trivial. 0 not checked. [2021-10-11 02:25:16,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:25:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 322 proven. 1190 refuted. 0 times theorem prover too weak. 3535 trivial. 0 not checked. [2021-10-11 02:25:19,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1596419536] [2021-10-11 02:25:19,398 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2021-10-11 02:25:19,399 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:25:19,399 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:25:19,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:25:19,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 18] total 23 [2021-10-11 02:25:19,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788600753] [2021-10-11 02:25:19,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-10-11 02:25:19,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:25:19,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-11 02:25:19,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2021-10-11 02:25:19,404 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand 23 states. [2021-10-11 02:25:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:25:19,609 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2021-10-11 02:25:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:25:19,610 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 296 [2021-10-11 02:25:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:25:19,613 INFO L225 Difference]: With dead ends: 137 [2021-10-11 02:25:19,613 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:25:19,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 573 SyntacticMatches, 15 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=280, Invalid=532, Unknown=0, NotChecked=0, Total=812 [2021-10-11 02:25:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:25:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-10-11 02:25:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 02:25:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2021-10-11 02:25:19,632 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 296 [2021-10-11 02:25:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:25:19,632 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2021-10-11 02:25:19,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-10-11 02:25:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2021-10-11 02:25:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2021-10-11 02:25:19,637 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:25:19,637 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2021-10-11 02:25:19,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:25:19,852 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:25:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:25:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1893730074, now seen corresponding path program 9 times [2021-10-11 02:25:19,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:25:19,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585156748] [2021-10-11 02:25:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:25:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:19,908 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:25:19,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:25:20,068 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:25:20,068 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:25:20,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:25:20,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:25:20 BoogieIcfgContainer [2021-10-11 02:25:20,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:25:20,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:25:20,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:25:20,202 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:25:20,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:25:02" (3/4) ... [2021-10-11 02:25:20,206 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:25:20,353 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e13c488a-2292-41fe-917e-2d6873dda03e/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:25:20,353 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:25:20,355 INFO L168 Benchmark]: Toolchain (without parser) took 18925.15 ms. Allocated memory was 88.1 MB in the beginning and 442.5 MB in the end (delta: 354.4 MB). Free memory was 52.8 MB in the beginning and 412.8 MB in the end (delta: -360.0 MB). Peak memory consumption was 250.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,355 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 88.1 MB. Free memory was 68.7 MB in the beginning and 68.7 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:25:20,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.74 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 84.4 MB in the end (delta: -31.7 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 107.0 MB. Free memory was 84.4 MB in the beginning and 82.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,357 INFO L168 Benchmark]: Boogie Preprocessor took 30.24 ms. Allocated memory is still 107.0 MB. Free memory was 82.9 MB in the beginning and 82.0 MB in the end (delta: 931.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:25:20,357 INFO L168 Benchmark]: RCFGBuilder took 474.22 ms. Allocated memory is still 107.0 MB. Free memory was 82.0 MB in the beginning and 68.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,358 INFO L168 Benchmark]: TraceAbstraction took 17932.37 ms. Allocated memory was 107.0 MB in the beginning and 442.5 MB in the end (delta: 335.5 MB). Free memory was 68.2 MB in the beginning and 166.4 MB in the end (delta: -98.2 MB). Peak memory consumption was 238.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,358 INFO L168 Benchmark]: Witness Printer took 152.10 ms. Allocated memory is still 442.5 MB. Free memory was 166.4 MB in the beginning and 412.8 MB in the end (delta: -246.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:25:20,360 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.21 ms. Allocated memory is still 88.1 MB. Free memory was 68.7 MB in the beginning and 68.7 MB in the end (delta: 77.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 291.74 ms. Allocated memory was 88.1 MB in the beginning and 107.0 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 84.4 MB in the end (delta: -31.7 MB). Peak memory consumption was 7.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.19 ms. Allocated memory is still 107.0 MB. Free memory was 84.4 MB in the beginning and 82.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.24 ms. Allocated memory is still 107.0 MB. Free memory was 82.9 MB in the beginning and 82.0 MB in the end (delta: 931.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 474.22 ms. Allocated memory is still 107.0 MB. Free memory was 82.0 MB in the beginning and 68.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17932.37 ms. Allocated memory was 107.0 MB in the beginning and 442.5 MB in the end (delta: 335.5 MB). Free memory was 68.2 MB in the beginning and 166.4 MB in the end (delta: -98.2 MB). Peak memory consumption was 238.7 MB. Max. memory is 16.1 GB. * Witness Printer took 152.10 ms. Allocated memory is still 442.5 MB. Free memory was 166.4 MB in the beginning and 412.8 MB in the end (delta: -246.3 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) 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); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.7s, OverallIterations: 12, TraceHistogramMax: 47, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 195 SDtfs, 442 SDslu, 550 SDs, 0 SdLazy, 1071 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2485 GetRequests, 2276 SyntacticMatches, 29 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 2627 NumberOfCodeBlocks, 2422 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1204458 SizeOfPredicates, 46 NumberOfNonLiveVariables, 2353 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 29 InterpolantComputations, 2 PerfectInterpolantSequences, 38702/46299 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...