./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe571d33601eb001defa960d70b02ea99b59263c ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 21:22:11,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:22:11,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:22:11,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:22:11,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:22:11,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:22:11,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:22:11,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:22:11,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:22:11,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:22:11,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:22:11,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:22:11,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:22:11,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:22:11,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:22:11,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:22:11,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:22:11,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:22:11,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:22:11,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:22:11,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:22:11,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:22:11,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:22:11,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:22:11,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:22:11,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:22:11,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:22:11,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:22:11,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:22:11,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:22:11,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:22:11,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:22:11,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:22:11,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:22:11,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:22:11,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:22:11,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:22:11,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:22:11,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:22:11,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:22:11,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:22:11,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:22:11,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:22:11,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:22:11,077 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:22:11,077 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:22:11,077 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:22:11,077 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:22:11,078 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:22:11,079 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:22:11,079 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:22:11,079 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:22:11,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:22:11,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:22:11,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:22:11,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:22:11,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:22:11,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:22:11,082 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:22:11,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:22:11,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:22:11,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:22:11,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:22:11,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:22:11,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:22:11,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:22:11,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:22:11,083 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:22:11,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:22:11,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:22:11,084 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:22:11,084 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:22:11,084 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> fe571d33601eb001defa960d70b02ea99b59263c [2019-12-07 21:22:11,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:22:11,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:22:11,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:22:11,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:22:11,200 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:22:11,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/../../sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2019-12-07 21:22:11,237 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/data/834579e31/e19fa4b5bcbb4978abf02d4df6b296f7/FLAG3c4b027eb [2019-12-07 21:22:11,592 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:22:11,593 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/sv-benchmarks/c/recursive-simple/fibo_2calls_5-2.c [2019-12-07 21:22:11,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/data/834579e31/e19fa4b5bcbb4978abf02d4df6b296f7/FLAG3c4b027eb [2019-12-07 21:22:11,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/data/834579e31/e19fa4b5bcbb4978abf02d4df6b296f7 [2019-12-07 21:22:11,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:22:11,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:22:11,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:11,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:22:11,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:22:11,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9c5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11, skipping insertion in model container [2019-12-07 21:22:11,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:22:11,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:22:11,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:11,730 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:22:11,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:11,789 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:22:11,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11 WrapperNode [2019-12-07 21:22:11,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:11,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:11,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:22:11,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:22:11,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:11,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:22:11,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:22:11,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:22:11,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... [2019-12-07 21:22:11,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:22:11,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:22:11,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:22:11,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:22:11,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:22:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:22:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:22:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-12-07 21:22:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-12-07 21:22:11,869 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-12-07 21:22:11,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-12-07 21:22:11,984 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:22:11,984 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 21:22:11,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:11 BoogieIcfgContainer [2019-12-07 21:22:11,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:22:11,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:22:11,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:22:11,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:22:11,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:22:11" (1/3) ... [2019-12-07 21:22:11,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1880b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:11, skipping insertion in model container [2019-12-07 21:22:11,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:11" (2/3) ... [2019-12-07 21:22:11,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1880b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:11, skipping insertion in model container [2019-12-07 21:22:11,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:11" (3/3) ... [2019-12-07 21:22:11,990 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2019-12-07 21:22:11,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:22:12,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:22:12,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:22:12,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:22:12,022 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:22:12,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:22:12,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:22:12,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:22:12,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:22:12,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:22:12,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:22:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-12-07 21:22:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:22:12,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:12,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:12,037 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-12-07 21:22:12,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:12,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803072536] [2019-12-07 21:22:12,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:22:12,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803072536] [2019-12-07 21:22:12,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:12,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:22:12,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891383326] [2019-12-07 21:22:12,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:22:12,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:12,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:22:12,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:22:12,189 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 7 states. [2019-12-07 21:22:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:12,287 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-12-07 21:22:12,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:22:12,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 21:22:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:12,295 INFO L225 Difference]: With dead ends: 36 [2019-12-07 21:22:12,295 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 21:22:12,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:22:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 21:22:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-07 21:22:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 21:22:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 21:22:12,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-12-07 21:22:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:12,327 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 21:22:12,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:22:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 21:22:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:22:12,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:12,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:12,328 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-12-07 21:22:12,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:12,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400748331] [2019-12-07 21:22:12,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:22:12,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400748331] [2019-12-07 21:22:12,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:12,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:22:12,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417310702] [2019-12-07 21:22:12,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:22:12,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:22:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:22:12,366 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-12-07 21:22:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:12,431 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-12-07 21:22:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:22:12,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 21:22:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:12,432 INFO L225 Difference]: With dead ends: 32 [2019-12-07 21:22:12,432 INFO L226 Difference]: Without dead ends: 28 [2019-12-07 21:22:12,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:22:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-07 21:22:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-12-07 21:22:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 21:22:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 21:22:12,438 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-12-07 21:22:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:12,438 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 21:22:12,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:22:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-12-07 21:22:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:22:12,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:12,439 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:12,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:12,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-12-07 21:22:12,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:12,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89887662] [2019-12-07 21:22:12,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89887662] [2019-12-07 21:22:12,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897083206] [2019-12-07 21:22:12,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:12,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:22:12,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:12,601 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:12,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:12,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [502379174] [2019-12-07 21:22:12,753 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-12-07 21:22:12,753 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:12,757 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:22:12,761 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:22:12,762 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:22:12,818 INFO L197 IcfgInterpreter]: Interpreting procedure fibo1 with input of size 3 for LOIs [2019-12-07 21:22:12,825 INFO L197 IcfgInterpreter]: Interpreting procedure fibo2 with input of size 8 for LOIs [2019-12-07 21:22:12,827 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:22:12,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:12,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 7, 7] total 22 [2019-12-07 21:22:12,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368276817] [2019-12-07 21:22:12,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:22:12,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:22:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:22:12,937 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-12-07 21:22:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:12,968 INFO L93 Difference]: Finished difference Result 68 states and 91 transitions. [2019-12-07 21:22:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:22:12,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 21:22:12,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:12,969 INFO L225 Difference]: With dead ends: 68 [2019-12-07 21:22:12,969 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 21:22:12,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:22:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 21:22:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-12-07 21:22:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 21:22:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2019-12-07 21:22:12,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2019-12-07 21:22:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:12,977 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2019-12-07 21:22:12,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:22:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2019-12-07 21:22:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 21:22:12,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:12,979 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:13,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:13,180 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-12-07 21:22:13,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:13,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491992161] [2019-12-07 21:22:13,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:22:13,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491992161] [2019-12-07 21:22:13,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75081410] [2019-12-07 21:22:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:13,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:13,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:22:13,447 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 21:22:13,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875908800] [2019-12-07 21:22:13,692 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:13,692 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:13,693 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:13,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:13,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 9] total 25 [2019-12-07 21:22:13,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486071034] [2019-12-07 21:22:13,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 21:22:13,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 21:22:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:22:13,696 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 25 states. [2019-12-07 21:22:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:13,959 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2019-12-07 21:22:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:22:13,959 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-12-07 21:22:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:13,961 INFO L225 Difference]: With dead ends: 85 [2019-12-07 21:22:13,961 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 21:22:13,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-12-07 21:22:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 21:22:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-12-07 21:22:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 21:22:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-12-07 21:22:13,969 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 35 [2019-12-07 21:22:13,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:13,969 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-12-07 21:22:13,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 21:22:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-12-07 21:22:13,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:22:13,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:13,971 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:14,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:14,172 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-12-07 21:22:14,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:14,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401341952] [2019-12-07 21:22:14,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 21:22:14,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401341952] [2019-12-07 21:22:14,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042394926] [2019-12-07 21:22:14,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:14,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:14,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:22:14,385 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 21:22:14,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [306069093] [2019-12-07 21:22:14,624 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:14,624 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:14,624 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:14,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:14,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 9] total 23 [2019-12-07 21:22:14,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929012107] [2019-12-07 21:22:14,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 21:22:14,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 21:22:14,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-12-07 21:22:14,627 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 23 states. [2019-12-07 21:22:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:14,928 INFO L93 Difference]: Finished difference Result 90 states and 139 transitions. [2019-12-07 21:22:14,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:22:14,928 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-12-07 21:22:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:14,930 INFO L225 Difference]: With dead ends: 90 [2019-12-07 21:22:14,930 INFO L226 Difference]: Without dead ends: 67 [2019-12-07 21:22:14,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 21:22:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-07 21:22:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2019-12-07 21:22:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-07 21:22:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-12-07 21:22:14,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 36 [2019-12-07 21:22:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:14,944 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-12-07 21:22:14,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 21:22:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2019-12-07 21:22:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:22:14,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:14,946 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:15,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:15,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1007070357, now seen corresponding path program 2 times [2019-12-07 21:22:15,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:15,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164792250] [2019-12-07 21:22:15,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 21:22:15,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164792250] [2019-12-07 21:22:15,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285571876] [2019-12-07 21:22:15,374 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:15,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:22:15,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:15,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:15,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 21:22:15,469 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 21:22:15,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [736503279] [2019-12-07 21:22:15,708 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:15,708 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:15,708 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:15,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:15,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 8, 9] total 28 [2019-12-07 21:22:15,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437751072] [2019-12-07 21:22:15,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 21:22:15,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 21:22:15,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2019-12-07 21:22:15,710 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand 28 states. [2019-12-07 21:22:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:16,679 INFO L93 Difference]: Finished difference Result 134 states and 233 transitions. [2019-12-07 21:22:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 21:22:16,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2019-12-07 21:22:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:16,683 INFO L225 Difference]: With dead ends: 134 [2019-12-07 21:22:16,683 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 21:22:16,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=394, Invalid=2686, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 21:22:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 21:22:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2019-12-07 21:22:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 21:22:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2019-12-07 21:22:16,709 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 48 [2019-12-07 21:22:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:16,710 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2019-12-07 21:22:16,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 21:22:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2019-12-07 21:22:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 21:22:16,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:16,713 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:16,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:16,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2054832360, now seen corresponding path program 1 times [2019-12-07 21:22:16,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:16,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637538230] [2019-12-07 21:22:16,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 21:22:17,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637538230] [2019-12-07 21:22:17,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822636467] [2019-12-07 21:22:17,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:17,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:22:17,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 21:22:17,228 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:22:17,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094340635] [2019-12-07 21:22:17,581 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:17,581 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:17,582 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:17,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:17,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 11] total 29 [2019-12-07 21:22:17,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861205225] [2019-12-07 21:22:17,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 21:22:17,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 21:22:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-12-07 21:22:17,584 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 29 states. [2019-12-07 21:22:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:17,871 INFO L93 Difference]: Finished difference Result 157 states and 313 transitions. [2019-12-07 21:22:17,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:22:17,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2019-12-07 21:22:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:17,872 INFO L225 Difference]: With dead ends: 157 [2019-12-07 21:22:17,872 INFO L226 Difference]: Without dead ends: 76 [2019-12-07 21:22:17,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1125, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:22:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-07 21:22:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. [2019-12-07 21:22:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 21:22:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-12-07 21:22:17,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 49 [2019-12-07 21:22:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:17,883 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-12-07 21:22:17,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 21:22:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-12-07 21:22:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 21:22:17,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:17,885 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:18,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:18,086 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -751947822, now seen corresponding path program 1 times [2019-12-07 21:22:18,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:18,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961564637] [2019-12-07 21:22:18,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 21:22:18,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961564637] [2019-12-07 21:22:18,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049727232] [2019-12-07 21:22:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:18,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:22:18,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 21:22:18,343 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-07 21:22:18,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569334117] [2019-12-07 21:22:18,701 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:18,701 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:18,701 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:18,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:18,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 11] total 27 [2019-12-07 21:22:18,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104500488] [2019-12-07 21:22:18,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 21:22:18,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 21:22:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:22:18,703 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 27 states. [2019-12-07 21:22:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:19,132 INFO L93 Difference]: Finished difference Result 109 states and 192 transitions. [2019-12-07 21:22:19,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:22:19,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-12-07 21:22:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:19,134 INFO L225 Difference]: With dead ends: 109 [2019-12-07 21:22:19,134 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 21:22:19,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 93 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1574, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 21:22:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 21:22:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2019-12-07 21:22:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 21:22:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-12-07 21:22:19,142 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 51 [2019-12-07 21:22:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:19,142 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-12-07 21:22:19,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 21:22:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2019-12-07 21:22:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 21:22:19,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:19,143 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:19,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:19,345 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 177614216, now seen corresponding path program 2 times [2019-12-07 21:22:19,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:19,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122470459] [2019-12-07 21:22:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-07 21:22:19,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122470459] [2019-12-07 21:22:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426611419] [2019-12-07 21:22:19,688 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:19,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:22:19,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:19,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:19,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 47 proven. 12 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 21:22:19,777 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 21:22:20,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1919814156] [2019-12-07 21:22:20,037 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:20,037 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:20,037 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:20,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:20,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 9] total 34 [2019-12-07 21:22:20,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526040019] [2019-12-07 21:22:20,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-07 21:22:20,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-07 21:22:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1043, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 21:22:20,039 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand 34 states. [2019-12-07 21:22:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:20,999 INFO L93 Difference]: Finished difference Result 109 states and 181 transitions. [2019-12-07 21:22:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:22:20,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 77 [2019-12-07 21:22:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:21,000 INFO L225 Difference]: With dead ends: 109 [2019-12-07 21:22:21,000 INFO L226 Difference]: Without dead ends: 98 [2019-12-07 21:22:21,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=2855, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 21:22:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-07 21:22:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-12-07 21:22:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:22:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2019-12-07 21:22:21,009 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 77 [2019-12-07 21:22:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:21,009 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2019-12-07 21:22:21,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-07 21:22:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2019-12-07 21:22:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 21:22:21,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:21,011 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:21,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:21,211 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:21,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:21,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2013716095, now seen corresponding path program 3 times [2019-12-07 21:22:21,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:21,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558288572] [2019-12-07 21:22:21,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 10 proven. 83 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 21:22:21,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558288572] [2019-12-07 21:22:21,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931485072] [2019-12-07 21:22:21,568 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:21,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:22:21,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:21,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:22:21,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:21,686 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 21:22:21,686 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 22 proven. 49 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 21:22:22,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906621255] [2019-12-07 21:22:22,089 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:22,090 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:22,090 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:22,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:22,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 9, 11] total 38 [2019-12-07 21:22:22,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282288294] [2019-12-07 21:22:22,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 21:22:22,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:22,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 21:22:22,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1311, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 21:22:22,092 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand 38 states. [2019-12-07 21:22:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:23,853 INFO L93 Difference]: Finished difference Result 192 states and 339 transitions. [2019-12-07 21:22:23,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 21:22:23,854 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 78 [2019-12-07 21:22:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:23,855 INFO L225 Difference]: With dead ends: 192 [2019-12-07 21:22:23,855 INFO L226 Difference]: Without dead ends: 124 [2019-12-07 21:22:23,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 152 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=516, Invalid=4040, Unknown=0, NotChecked=0, Total=4556 [2019-12-07 21:22:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-07 21:22:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2019-12-07 21:22:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 21:22:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2019-12-07 21:22:23,865 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 78 [2019-12-07 21:22:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:23,866 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2019-12-07 21:22:23,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 21:22:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2019-12-07 21:22:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 21:22:23,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:23,867 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:24,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:24,069 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1522718458, now seen corresponding path program 1 times [2019-12-07 21:22:24,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:24,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175818722] [2019-12-07 21:22:24,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 72 proven. 43 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-12-07 21:22:24,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175818722] [2019-12-07 21:22:24,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479845110] [2019-12-07 21:22:24,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:24,247 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:24,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 21:22:24,270 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-12-07 21:22:24,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933987115] [2019-12-07 21:22:24,479 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:24,479 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:24,479 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:24,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:24,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 19 [2019-12-07 21:22:24,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944518333] [2019-12-07 21:22:24,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 21:22:24,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 21:22:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-07 21:22:24,481 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand 19 states. [2019-12-07 21:22:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:24,744 INFO L93 Difference]: Finished difference Result 255 states and 482 transitions. [2019-12-07 21:22:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:22:24,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-12-07 21:22:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:24,747 INFO L225 Difference]: With dead ends: 255 [2019-12-07 21:22:24,747 INFO L226 Difference]: Without dead ends: 146 [2019-12-07 21:22:24,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 177 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 21:22:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-07 21:22:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2019-12-07 21:22:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 21:22:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 242 transitions. [2019-12-07 21:22:24,762 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 242 transitions. Word has length 92 [2019-12-07 21:22:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:24,762 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 242 transitions. [2019-12-07 21:22:24,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 21:22:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 242 transitions. [2019-12-07 21:22:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 21:22:24,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:24,766 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 10, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:24,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:24,966 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1645511071, now seen corresponding path program 2 times [2019-12-07 21:22:24,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:24,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414302401] [2019-12-07 21:22:24,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 88 proven. 271 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-12-07 21:22:25,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414302401] [2019-12-07 21:22:25,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314920540] [2019-12-07 21:22:25,541 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:25,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 21:22:25,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:25,585 INFO L264 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:22:25,587 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 350 proven. 24 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-12-07 21:22:25,717 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 145 proven. 103 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2019-12-07 21:22:26,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [434802187] [2019-12-07 21:22:26,378 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:26,378 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:26,378 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:26,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:26,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 11, 11] total 50 [2019-12-07 21:22:26,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936176127] [2019-12-07 21:22:26,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 21:22:26,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 21:22:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 21:22:26,381 INFO L87 Difference]: Start difference. First operand 135 states and 242 transitions. Second operand 50 states. [2019-12-07 21:22:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:28,777 INFO L93 Difference]: Finished difference Result 361 states and 780 transitions. [2019-12-07 21:22:28,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 21:22:28,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 147 [2019-12-07 21:22:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:28,780 INFO L225 Difference]: With dead ends: 361 [2019-12-07 21:22:28,780 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 21:22:28,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 291 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1008, Invalid=10122, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 21:22:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 21:22:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 151. [2019-12-07 21:22:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 21:22:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 280 transitions. [2019-12-07 21:22:28,802 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 280 transitions. Word has length 147 [2019-12-07 21:22:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:28,802 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 280 transitions. [2019-12-07 21:22:28,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 21:22:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 280 transitions. [2019-12-07 21:22:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 21:22:28,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:28,805 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:29,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:29,007 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:29,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1247065787, now seen corresponding path program 1 times [2019-12-07 21:22:29,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:29,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185231174] [2019-12-07 21:22:29,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 94 proven. 263 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-12-07 21:22:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185231174] [2019-12-07 21:22:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179894179] [2019-12-07 21:22:29,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:29,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:22:29,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 75 proven. 115 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-12-07 21:22:29,799 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 74 proven. 120 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-12-07 21:22:30,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [694980014] [2019-12-07 21:22:30,383 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:30,383 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:30,384 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:30,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:30,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 10, 12] total 50 [2019-12-07 21:22:30,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963949620] [2019-12-07 21:22:30,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-07 21:22:30,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-07 21:22:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2301, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 21:22:30,386 INFO L87 Difference]: Start difference. First operand 151 states and 280 transitions. Second operand 50 states. [2019-12-07 21:22:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:33,064 INFO L93 Difference]: Finished difference Result 371 states and 1305 transitions. [2019-12-07 21:22:33,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 21:22:33,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 147 [2019-12-07 21:22:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:33,067 INFO L225 Difference]: With dead ends: 371 [2019-12-07 21:22:33,067 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 21:22:33,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 297 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=960, Invalid=7596, Unknown=0, NotChecked=0, Total=8556 [2019-12-07 21:22:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 21:22:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 98. [2019-12-07 21:22:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-07 21:22:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2019-12-07 21:22:33,082 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 147 [2019-12-07 21:22:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:33,082 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2019-12-07 21:22:33,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-07 21:22:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2019-12-07 21:22:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 21:22:33,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:33,083 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:33,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:33,285 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash -345797994, now seen corresponding path program 3 times [2019-12-07 21:22:33,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:33,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802872348] [2019-12-07 21:22:33,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 110 proven. 31 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 21:22:33,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802872348] [2019-12-07 21:22:33,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605462461] [2019-12-07 21:22:33,395 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:33,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:22:33,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:33,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 21:22:33,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-12-07 21:22:33,469 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 111 proven. 33 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-12-07 21:22:33,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19209823] [2019-12-07 21:22:33,861 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-12-07 21:22:33,861 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:22:33,861 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:22:33,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:22:33,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 18 [2019-12-07 21:22:33,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603314012] [2019-12-07 21:22:33,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 21:22:33,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:33,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 21:22:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:22:33,862 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 18 states. [2019-12-07 21:22:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:33,971 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2019-12-07 21:22:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:22:33,971 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2019-12-07 21:22:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:33,972 INFO L225 Difference]: With dead ends: 108 [2019-12-07 21:22:33,972 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 21:22:33,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 221 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:22:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 21:22:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2019-12-07 21:22:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 21:22:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2019-12-07 21:22:33,979 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 118 [2019-12-07 21:22:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:33,979 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2019-12-07 21:22:33,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 21:22:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2019-12-07 21:22:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 21:22:33,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:33,981 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:34,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:22:34,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:34,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 4 times [2019-12-07 21:22:34,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:34,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372054581] [2019-12-07 21:22:34,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:22:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:22:34,219 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:22:34,219 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:22:34,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:22:34 BoogieIcfgContainer [2019-12-07 21:22:34,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:22:34,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:22:34,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:22:34,247 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:22:34,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:11" (3/4) ... [2019-12-07 21:22:34,249 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:22:34,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53691ab0-ac5d-4d9b-a34b-f329a237a0fd/bin/utaipan/witness.graphml [2019-12-07 21:22:34,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:22:34,289 INFO L168 Benchmark]: Toolchain (without parser) took 22681.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 946.2 MB in the beginning and 823.1 MB in the end (delta: 123.1 MB). Peak memory consumption was 400.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,289 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:22:34,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:22:34,290 INFO L168 Benchmark]: Boogie Preprocessor took 11.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,290 INFO L168 Benchmark]: RCFGBuilder took 156.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,291 INFO L168 Benchmark]: TraceAbstraction took 22261.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 826.1 MB in the end (delta: 259.7 MB). Peak memory consumption was 428.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,291 INFO L168 Benchmark]: Witness Printer took 40.59 ms. Allocated memory is still 1.3 GB. Free memory was 826.1 MB in the beginning and 823.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:22:34,292 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 181.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 156.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22261.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.1 GB in the beginning and 826.1 MB in the end (delta: 259.7 MB). Peak memory consumption was 428.5 MB. Max. memory is 11.5 GB. * Witness Printer took 40.59 ms. Allocated memory is still 1.3 GB. Free memory was 826.1 MB in the beginning and 823.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; [L37] CALL, EXPR fibo1(x) 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 fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 5 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 15, TraceHistogramMax: 13, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 305 SDtfs, 742 SDslu, 4217 SDs, 0 SdLazy, 12276 SolverSat, 1293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2417 GetRequests, 1737 SyntacticMatches, 92 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6259 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 351 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1924 NumberOfCodeBlocks, 1800 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2681 ConstructedInterpolants, 0 QuantifiedInterpolants, 575868 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1736 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 4718/6375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 75, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 15, DAG_INTERPRETER_EARLY_EXITS: 6, TOOLS_POST_APPLICATIONS: 13, TOOLS_POST_TIME[ms]: 2, TOOLS_POST_CALL_APPLICATIONS: 8, TOOLS_POST_CALL_TIME[ms]: 5, TOOLS_POST_RETURN_APPLICATIONS: 6, TOOLS_POST_RETURN_TIME[ms]: 3, TOOLS_QUANTIFIERELIM_APPLICATIONS: 27, TOOLS_QUANTIFIERELIM_TIME[ms]: 6, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 1, FLUID_QUERY_TIME[ms]: 2, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME[ms]: 20, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME[ms]: 0, DOMAIN_ISBOTTOM_APPLICATIONS: 15, DOMAIN_ISBOTTOM_TIME[ms]: 8, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 0, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 6, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 32, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 32, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 3, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 8, DAG_COMPRESSION_PROCESSED_NODES: 142, DAG_COMPRESSION_RETAINED_NODES: 53, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...