./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-11-15 22:13:02,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:13:02,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:13:02,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:13:02,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:13:02,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:13:02,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:13:02,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:13:02,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:13:02,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:13:02,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:13:02,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:13:02,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:13:02,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:13:02,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:13:02,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:13:02,956 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:13:02,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:13:02,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:13:02,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:13:02,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:13:02,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:13:02,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:13:02,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:13:02,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:13:02,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:13:02,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:13:02,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:13:02,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:13:02,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:13:02,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:13:02,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:13:02,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:13:02,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:13:02,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:13:02,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:13:03,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:13:03,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:13:03,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:13:03,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:13:03,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:13:03,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:13:03,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:13:03,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:13:03,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:13:03,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:13:03,023 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:13:03,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:13:03,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:13:03,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:13:03,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:13:03,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:13:03,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:13:03,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:13:03,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:13:03,025 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:13:03,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:13:03,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:13:03,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:13:03,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:13:03,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:13:03,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:13:03,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:13:03,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:13:03,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:13:03,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:13:03,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:13:03,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:13:03,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:13:03,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:13:03,030 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer 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 -> Automizer 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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2019-11-15 22:13:03,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:13:03,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:13:03,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:13:03,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:13:03,096 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:13:03,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-15 22:13:03,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/data/e84ff387e/904f6b7398b14cc9b63ded7e93fd3113/FLAGf7182c57f [2019-11-15 22:13:03,521 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:13:03,521 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-15 22:13:03,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/data/e84ff387e/904f6b7398b14cc9b63ded7e93fd3113/FLAGf7182c57f [2019-11-15 22:13:03,537 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/data/e84ff387e/904f6b7398b14cc9b63ded7e93fd3113 [2019-11-15 22:13:03,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:13:03,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:13:03,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:03,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:13:03,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:13:03,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d12a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03, skipping insertion in model container [2019-11-15 22:13:03,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:13:03,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:13:03,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:03,834 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:13:03,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:13:03,867 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:13:03,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03 WrapperNode [2019-11-15 22:13:03,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:13:03,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:03,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:13:03,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:13:03,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:13:03,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:13:03,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:13:03,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:13:03,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... [2019-11-15 22:13:03,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:13:03,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:13:03,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:13:03,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:13:03,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:13:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:13:03,977 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-15 22:13:03,977 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-15 22:13:03,978 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-15 22:13:03,978 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-15 22:13:04,161 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:13:04,161 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 22:13:04,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:04 BoogieIcfgContainer [2019-11-15 22:13:04,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:13:04,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:13:04,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:13:04,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:13:04,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:13:03" (1/3) ... [2019-11-15 22:13:04,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:04, skipping insertion in model container [2019-11-15 22:13:04,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:13:03" (2/3) ... [2019-11-15 22:13:04,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b73f22b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:13:04, skipping insertion in model container [2019-11-15 22:13:04,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:04" (3/3) ... [2019-11-15 22:13:04,169 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-11-15 22:13:04,192 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:13:04,214 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:13:04,224 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:13:04,264 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:13:04,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:13:04,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:13:04,265 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:13:04,265 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:13:04,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:13:04,266 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:13:04,266 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:13:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-15 22:13:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 22:13:04,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:04,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:04,298 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-15 22:13:04,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:04,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058869961] [2019-11-15 22:13:04,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:04,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058869961] [2019-11-15 22:13:04,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:04,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:13:04,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886267850] [2019-11-15 22:13:04,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:13:04,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:13:04,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:13:04,598 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-15 22:13:04,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:04,721 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-15 22:13:04,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:13:04,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-15 22:13:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:04,732 INFO L225 Difference]: With dead ends: 38 [2019-11-15 22:13:04,733 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 22:13:04,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:13:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 22:13:04,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 22:13:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:13:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 22:13:04,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-15 22:13:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:04,777 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:13:04,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:13:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 22:13:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 22:13:04,779 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:04,779 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:04,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:04,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:04,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-15 22:13:04,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:04,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369935805] [2019-11-15 22:13:04,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:13:04,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369935805] [2019-11-15 22:13:04,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:13:04,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:13:04,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118780394] [2019-11-15 22:13:04,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:13:04,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:13:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:13:04,855 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-15 22:13:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:04,947 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-15 22:13:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:13:04,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-15 22:13:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:04,950 INFO L225 Difference]: With dead ends: 32 [2019-11-15 22:13:04,950 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 22:13:04,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:13:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 22:13:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-15 22:13:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:13:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 22:13:04,958 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-15 22:13:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:04,958 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 22:13:04,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:13:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 22:13:04,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:13:04,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:04,960 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:04,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:04,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-15 22:13:04,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:04,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682458109] [2019-11-15 22:13:04,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:04,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:05,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682458109] [2019-11-15 22:13:05,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770500815] [2019-11-15 22:13:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:13:05,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:05,286 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:05,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 22:13:05,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28318915] [2019-11-15 22:13:05,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:13:05,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:13:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:13:05,296 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-15 22:13:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:05,470 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-15 22:13:05,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:13:05,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-15 22:13:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:05,472 INFO L225 Difference]: With dead ends: 59 [2019-11-15 22:13:05,472 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 22:13:05,473 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:13:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 22:13:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-15 22:13:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 22:13:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-15 22:13:05,481 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-15 22:13:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:05,482 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-15 22:13:05,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:13:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-15 22:13:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:13:05,484 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:05,484 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:05,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:05,688 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-15 22:13:05,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:05,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812624741] [2019-11-15 22:13:05,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:05,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:05,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:05,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812624741] [2019-11-15 22:13:05,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606861456] [2019-11-15 22:13:05,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:05,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:13:05,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 22:13:05,924 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:05,924 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 22:13:05,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847416099] [2019-11-15 22:13:05,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:13:05,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:13:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:13:05,925 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-15 22:13:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:06,171 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-15 22:13:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:13:06,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-15 22:13:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:06,176 INFO L225 Difference]: With dead ends: 55 [2019-11-15 22:13:06,179 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 22:13:06,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:13:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 22:13:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-15 22:13:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 22:13:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-15 22:13:06,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-15 22:13:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:06,198 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-15 22:13:06,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:13:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-15 22:13:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:13:06,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:06,201 INFO L380 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-11-15 22:13:06,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:06,405 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-15 22:13:06,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:06,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644883568] [2019-11-15 22:13:06,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:06,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:06,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:13:06,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644883568] [2019-11-15 22:13:06,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154271801] [2019-11-15 22:13:06,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:06,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:13:06,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:13:06,686 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:06,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-15 22:13:06,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427323538] [2019-11-15 22:13:06,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:13:06,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:06,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:13:06,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:13:06,688 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-15 22:13:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:07,152 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-15 22:13:07,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:13:07,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-15 22:13:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:07,155 INFO L225 Difference]: With dead ends: 114 [2019-11-15 22:13:07,155 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 22:13:07,156 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:13:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 22:13:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-15 22:13:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 22:13:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-15 22:13:07,171 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-15 22:13:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:07,172 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-15 22:13:07,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:13:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-15 22:13:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 22:13:07,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:07,174 INFO L380 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-11-15 22:13:07,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:07,386 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-15 22:13:07,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:07,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080831130] [2019-11-15 22:13:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:07,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-15 22:13:07,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080831130] [2019-11-15 22:13:07,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176155432] [2019-11-15 22:13:07,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:07,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:13:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 22:13:07,653 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:07,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-15 22:13:07,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758300496] [2019-11-15 22:13:07,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:13:07,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:07,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:13:07,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:13:07,655 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-15 22:13:07,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:07,944 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-15 22:13:07,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:13:07,944 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-15 22:13:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:07,946 INFO L225 Difference]: With dead ends: 147 [2019-11-15 22:13:07,947 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 22:13:07,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:13:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 22:13:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-15 22:13:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 22:13:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-15 22:13:07,961 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-15 22:13:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:07,962 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-15 22:13:07,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:13:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-15 22:13:07,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:13:07,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:07,965 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:08,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:08,171 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-15 22:13:08,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:08,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490844403] [2019-11-15 22:13:08,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:08,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:08,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-15 22:13:08,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490844403] [2019-11-15 22:13:08,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276882494] [2019-11-15 22:13:08,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:08,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:13:08,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 22:13:08,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:08,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-15 22:13:08,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373640417] [2019-11-15 22:13:08,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 22:13:08,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 22:13:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:13:08,502 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-15 22:13:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:08,978 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-15 22:13:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:13:08,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-15 22:13:08,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:08,981 INFO L225 Difference]: With dead ends: 164 [2019-11-15 22:13:08,982 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 22:13:08,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:13:08,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 22:13:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-15 22:13:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 22:13:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-15 22:13:09,007 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-15 22:13:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:09,008 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-15 22:13:09,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 22:13:09,008 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-15 22:13:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:13:09,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:09,013 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:09,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:09,218 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:09,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1894743046, now seen corresponding path program 2 times [2019-11-15 22:13:09,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:09,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556311642] [2019-11-15 22:13:09,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:09,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:09,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 33 proven. 56 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-15 22:13:09,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556311642] [2019-11-15 22:13:09,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330434609] [2019-11-15 22:13:09,600 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:09,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:09,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:09,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:13:09,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 13 proven. 88 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-15 22:13:09,797 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:09,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2019-11-15 22:13:09,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010822305] [2019-11-15 22:13:09,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 22:13:09,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 22:13:09,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:13:09,804 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 21 states. [2019-11-15 22:13:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:10,529 INFO L93 Difference]: Finished difference Result 212 states and 399 transitions. [2019-11-15 22:13:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:13:10,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2019-11-15 22:13:10,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:10,531 INFO L225 Difference]: With dead ends: 212 [2019-11-15 22:13:10,531 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 22:13:10,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 22:13:10,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 22:13:10,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2019-11-15 22:13:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-15 22:13:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2019-11-15 22:13:10,547 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2019-11-15 22:13:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:10,547 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2019-11-15 22:13:10,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 22:13:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2019-11-15 22:13:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:13:10,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:10,558 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:10,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:10,762 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash 735439019, now seen corresponding path program 1 times [2019-11-15 22:13:10,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:10,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016160932] [2019-11-15 22:13:10,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:10,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:10,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 123 proven. 256 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-15 22:13:11,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016160932] [2019-11-15 22:13:11,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245790099] [2019-11-15 22:13:11,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:11,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:13:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 63 proven. 180 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-15 22:13:11,575 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:11,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 25 [2019-11-15 22:13:11,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509458444] [2019-11-15 22:13:11,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:13:11,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:13:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:13:11,579 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand 25 states. [2019-11-15 22:13:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:12,288 INFO L93 Difference]: Finished difference Result 200 states and 307 transitions. [2019-11-15 22:13:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:13:12,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 188 [2019-11-15 22:13:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:12,290 INFO L225 Difference]: With dead ends: 200 [2019-11-15 22:13:12,290 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 22:13:12,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:13:12,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 22:13:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2019-11-15 22:13:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-15 22:13:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2019-11-15 22:13:12,305 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 188 [2019-11-15 22:13:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:12,305 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2019-11-15 22:13:12,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:13:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2019-11-15 22:13:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-15 22:13:12,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:12,308 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:12,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:12,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 2 times [2019-11-15 22:13:12,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:12,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961633871] [2019-11-15 22:13:12,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:12,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:12,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-15 22:13:12,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961633871] [2019-11-15 22:13:12,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849184510] [2019-11-15 22:13:12,983 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:13,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:13:13,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:13,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:13:13,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-15 22:13:13,150 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:13,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 25 [2019-11-15 22:13:13,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478755177] [2019-11-15 22:13:13,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 22:13:13,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 22:13:13,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:13:13,152 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand 25 states. [2019-11-15 22:13:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:13,783 INFO L93 Difference]: Finished difference Result 227 states and 363 transitions. [2019-11-15 22:13:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:13:13,783 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-11-15 22:13:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:13,786 INFO L225 Difference]: With dead ends: 227 [2019-11-15 22:13:13,786 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:13:13,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:13:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:13:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2019-11-15 22:13:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 22:13:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2019-11-15 22:13:13,812 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 146 [2019-11-15 22:13:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:13,815 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2019-11-15 22:13:13,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 22:13:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2019-11-15 22:13:13,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-15 22:13:13,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:13,820 INFO L380 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 17, 14, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:14,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:14,025 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:14,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1957575691, now seen corresponding path program 3 times [2019-11-15 22:13:14,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:14,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647541012] [2019-11-15 22:13:14,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:14,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:14,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 467 proven. 589 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-11-15 22:13:14,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647541012] [2019-11-15 22:13:14,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135173817] [2019-11-15 22:13:14,921 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:15,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 22:13:15,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:15,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:13:15,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 383 proven. 75 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2019-11-15 22:13:15,227 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:15,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10] total 31 [2019-11-15 22:13:15,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023934002] [2019-11-15 22:13:15,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 22:13:15,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 22:13:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:13:15,230 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand 31 states. [2019-11-15 22:13:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:16,392 INFO L93 Difference]: Finished difference Result 297 states and 508 transitions. [2019-11-15 22:13:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 22:13:16,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 268 [2019-11-15 22:13:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:16,395 INFO L225 Difference]: With dead ends: 297 [2019-11-15 22:13:16,396 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 22:13:16,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=1965, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 22:13:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 22:13:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2019-11-15 22:13:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 22:13:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2019-11-15 22:13:16,418 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 268 [2019-11-15 22:13:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2019-11-15 22:13:16,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 22:13:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2019-11-15 22:13:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 22:13:16,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:16,424 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:16,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:16,627 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 4 times [2019-11-15 22:13:16,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:16,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517276582] [2019-11-15 22:13:16,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:16,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:17,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-11-15 22:13:17,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517276582] [2019-11-15 22:13:17,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879536491] [2019-11-15 22:13:17,344 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:17,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 22:13:17,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:17,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 22:13:17,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 250 proven. 118 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2019-11-15 22:13:17,591 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:17,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 30 [2019-11-15 22:13:17,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775609885] [2019-11-15 22:13:17,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 22:13:17,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 22:13:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:13:17,599 INFO L87 Difference]: Start difference. First operand 131 states and 178 transitions. Second operand 30 states. [2019-11-15 22:13:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:18,404 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2019-11-15 22:13:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 22:13:18,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 214 [2019-11-15 22:13:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:18,407 INFO L225 Difference]: With dead ends: 289 [2019-11-15 22:13:18,407 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:13:18,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 22:13:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:13:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2019-11-15 22:13:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 22:13:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 191 transitions. [2019-11-15 22:13:18,421 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 191 transitions. Word has length 214 [2019-11-15 22:13:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:18,422 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 191 transitions. [2019-11-15 22:13:18,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 22:13:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 191 transitions. [2019-11-15 22:13:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 22:13:18,424 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:18,424 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:18,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:18,628 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1338982035, now seen corresponding path program 5 times [2019-11-15 22:13:18,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:18,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561067056] [2019-11-15 22:13:18,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:18,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:18,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:13:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 202 proven. 153 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-11-15 22:13:19,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561067056] [2019-11-15 22:13:19,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817530389] [2019-11-15 22:13:19,097 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/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-11-15 22:13:19,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-15 22:13:19,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:13:19,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 22:13:19,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:13:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 135 proven. 196 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-11-15 22:13:19,314 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:13:19,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 28 [2019-11-15 22:13:19,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806543507] [2019-11-15 22:13:19,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 22:13:19,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:13:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 22:13:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-11-15 22:13:19,318 INFO L87 Difference]: Start difference. First operand 140 states and 191 transitions. Second operand 28 states. [2019-11-15 22:13:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:13:19,982 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2019-11-15 22:13:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 22:13:19,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2019-11-15 22:13:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:13:19,985 INFO L225 Difference]: With dead ends: 287 [2019-11-15 22:13:19,985 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:13:19,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 22:13:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:13:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 22:13:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:13:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 196 transitions. [2019-11-15 22:13:20,004 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 196 transitions. Word has length 160 [2019-11-15 22:13:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:13:20,005 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 196 transitions. [2019-11-15 22:13:20,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 22:13:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 196 transitions. [2019-11-15 22:13:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 22:13:20,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:13:20,008 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 22:13:20,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:13:20,218 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:13:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:13:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 6 times [2019-11-15 22:13:20,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:13:20,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495402712] [2019-11-15 22:13:20,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:20,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:13:20,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:13:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:13:20,295 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:13:20,296 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:13:20,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:13:20 BoogieIcfgContainer [2019-11-15 22:13:20,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:13:20,384 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:13:20,384 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:13:20,385 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:13:20,385 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:13:04" (3/4) ... [2019-11-15 22:13:20,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:13:20,473 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e4834ab9-6ad0-4b24-bdc0-0f24228246a1/bin/uautomizer/witness.graphml [2019-11-15 22:13:20,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:13:20,476 INFO L168 Benchmark]: Toolchain (without parser) took 16935.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 946.1 MB in the beginning and 880.4 MB in the end (delta: 65.6 MB). Peak memory consumption was 362.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:20,476 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:13:20,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:20,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:13:20,477 INFO L168 Benchmark]: Boogie Preprocessor took 13.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:13:20,478 INFO L168 Benchmark]: RCFGBuilder took 249.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:20,478 INFO L168 Benchmark]: TraceAbstraction took 16220.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 233.4 MB). Peak memory consumption was 381.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:20,479 INFO L168 Benchmark]: Witness Printer took 89.72 ms. Allocated memory is still 1.3 GB. Free memory was 892.0 MB in the beginning and 880.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:13:20,481 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 249.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16220.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 233.4 MB). Peak memory consumption was 381.8 MB. Max. memory is 11.5 GB. * Witness Printer took 89.72 ms. Allocated memory is still 1.3 GB. Free memory was 892.0 MB in the beginning and 880.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 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 = 6; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR 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-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 14, TraceHistogramMax: 21, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 377 SDtfs, 830 SDslu, 3472 SDs, 0 SdLazy, 6186 SolverSat, 910 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1888 GetRequests, 1573 SyntacticMatches, 1 SemanticMatches, 314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2095 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 132 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2656 NumberOfCodeBlocks, 2509 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2459 ConstructedInterpolants, 0 QuantifiedInterpolants, 749705 SizeOfPredicates, 55 NumberOfNonLiveVariables, 2416 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 9034/11360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...