./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18ab16c8226f43cf595901df83a1f895912e466b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:14:39,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:14:39,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:14:39,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:14:39,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:14:39,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:14:39,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:14:39,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:14:39,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:14:39,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:14:39,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:14:39,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:14:39,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:14:39,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:14:39,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:14:39,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:14:39,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:14:39,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:14:39,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:14:39,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:14:39,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:14:39,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:14:39,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:14:39,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:14:39,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:14:39,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:14:39,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:14:39,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:14:39,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:14:39,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:14:39,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:14:39,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:14:39,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:14:39,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:14:39,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:14:39,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:14:39,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:14:39,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:14:39,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:14:39,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:14:39,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:14:39,460 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 18:14:39,488 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:14:39,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:14:39,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:14:39,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:14:39,490 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:14:39,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:14:39,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:14:39,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:14:39,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:14:39,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:14:39,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:14:39,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:14:39,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:14:39,492 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:14:39,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:14:39,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:14:39,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:14:39,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:14:39,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:14:39,493 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:14:39,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:14:39,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:14:39,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:14:39,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:14:39,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:14:39,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:14:39,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:14:39,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:14:39,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:14:39,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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(reach_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 -> 18ab16c8226f43cf595901df83a1f895912e466b [2020-11-29 18:14:39,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:14:39,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:14:39,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:14:39,834 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:14:39,836 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:14:39,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-29 18:14:39,936 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/data/cb05ef8f5/0ba9e7ee9aed4de597bc3b2318dc555b/FLAG592a40218 [2020-11-29 18:14:40,366 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:14:40,366 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-29 18:14:40,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/data/cb05ef8f5/0ba9e7ee9aed4de597bc3b2318dc555b/FLAG592a40218 [2020-11-29 18:14:40,778 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/data/cb05ef8f5/0ba9e7ee9aed4de597bc3b2318dc555b [2020-11-29 18:14:40,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:14:40,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:14:40,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:14:40,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:14:40,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:14:40,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:14:40" (1/1) ... [2020-11-29 18:14:40,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b3e2e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:40, skipping insertion in model container [2020-11-29 18:14:40,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:14:40" (1/1) ... [2020-11-29 18:14:40,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:14:40,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:14:40,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:14:40,951 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:14:40,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:14:41,005 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:14:41,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41 WrapperNode [2020-11-29 18:14:41,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:14:41,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:14:41,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:14:41,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:14:41,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:14:41,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:14:41,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:14:41,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:14:41,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... [2020-11-29 18:14:41,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:14:41,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:14:41,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:14:41,052 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:14:41,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-29 18:14:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-29 18:14:41,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:14:41,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:14:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:14:41,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:14:41,375 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:14:41,380 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-29 18:14:41,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:14:41 BoogieIcfgContainer [2020-11-29 18:14:41,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:14:41,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:14:41,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:14:41,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:14:41,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:14:40" (1/3) ... [2020-11-29 18:14:41,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e4278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:14:41, skipping insertion in model container [2020-11-29 18:14:41,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:14:41" (2/3) ... [2020-11-29 18:14:41,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5e4278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:14:41, skipping insertion in model container [2020-11-29 18:14:41,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:14:41" (3/3) ... [2020-11-29 18:14:41,415 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-29 18:14:41,425 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:14:41,429 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 18:14:41,459 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 18:14:41,481 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:14:41,481 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:14:41,482 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:14:41,482 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:14:41,482 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:14:41,482 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:14:41,482 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:14:41,482 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:14:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-11-29 18:14:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 18:14:41,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:41,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:41,501 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash -691997320, now seen corresponding path program 1 times [2020-11-29 18:14:41,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:41,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624003715] [2020-11-29 18:14:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:41,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:14:41,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624003715] [2020-11-29 18:14:41,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:14:41,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:14:41,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059478263] [2020-11-29 18:14:41,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:14:41,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:14:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:14:41,772 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-11-29 18:14:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:41,901 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-11-29 18:14:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:14:41,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-29 18:14:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:41,912 INFO L225 Difference]: With dead ends: 32 [2020-11-29 18:14:41,912 INFO L226 Difference]: Without dead ends: 18 [2020-11-29 18:14:41,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:14:41,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-11-29 18:14:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-29 18:14:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-29 18:14:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-29 18:14:41,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-11-29 18:14:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:41,952 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-29 18:14:41,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:14:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-29 18:14:41,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 18:14:41,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:41,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:41,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 18:14:41,955 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash 717045018, now seen corresponding path program 1 times [2020-11-29 18:14:41,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:41,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188438635] [2020-11-29 18:14:41,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:14:42,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188438635] [2020-11-29 18:14:42,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:14:42,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:14:42,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967245861] [2020-11-29 18:14:42,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:14:42,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:14:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:14:42,042 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-11-29 18:14:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:42,106 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-11-29 18:14:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:14:42,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-29 18:14:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:42,108 INFO L225 Difference]: With dead ends: 24 [2020-11-29 18:14:42,108 INFO L226 Difference]: Without dead ends: 20 [2020-11-29 18:14:42,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:14:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-29 18:14:42,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-11-29 18:14:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-29 18:14:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-29 18:14:42,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-11-29 18:14:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:42,116 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-29 18:14:42,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:14:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-29 18:14:42,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:14:42,117 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:42,118 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:42,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 18:14:42,118 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1426922965, now seen corresponding path program 1 times [2020-11-29 18:14:42,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:42,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120302811] [2020-11-29 18:14:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-29 18:14:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 18:14:42,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120302811] [2020-11-29 18:14:42,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147133450] [2020-11-29 18:14:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:14:42,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 18:14:42,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:42,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-29 18:14:42,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135602216] [2020-11-29 18:14:42,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 18:14:42,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:42,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 18:14:42,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:14:42,539 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-11-29 18:14:42,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:42,667 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-11-29 18:14:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:14:42,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-29 18:14:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:42,669 INFO L225 Difference]: With dead ends: 35 [2020-11-29 18:14:42,669 INFO L226 Difference]: Without dead ends: 20 [2020-11-29 18:14:42,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-29 18:14:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-29 18:14:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-29 18:14:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-29 18:14:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-11-29 18:14:42,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-11-29 18:14:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:42,680 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-29 18:14:42,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 18:14:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-11-29 18:14:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 18:14:42,685 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:42,685 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:42,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-29 18:14:42,892 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash 301752507, now seen corresponding path program 1 times [2020-11-29 18:14:42,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:42,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692777273] [2020-11-29 18:14:42,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:42,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 18:14:43,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692777273] [2020-11-29 18:14:43,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060183298] [2020-11-29 18:14:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-29 18:14:43,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-29 18:14:43,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:43,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-29 18:14:43,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142227058] [2020-11-29 18:14:43,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:14:43,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:43,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:14:43,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:14:43,101 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-11-29 18:14:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:43,196 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-11-29 18:14:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:14:43,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-29 18:14:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:43,200 INFO L225 Difference]: With dead ends: 38 [2020-11-29 18:14:43,200 INFO L226 Difference]: Without dead ends: 34 [2020-11-29 18:14:43,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:14:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-29 18:14:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-29 18:14:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-29 18:14:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-11-29 18:14:43,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-11-29 18:14:43,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:43,215 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-11-29 18:14:43,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:14:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-11-29 18:14:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-29 18:14:43,219 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:43,219 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:43,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:14:43,448 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:43,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1093063438, now seen corresponding path program 2 times [2020-11-29 18:14:43,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:43,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712976277] [2020-11-29 18:14:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-29 18:14:43,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712976277] [2020-11-29 18:14:43,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890077005] [2020-11-29 18:14:43,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:43,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-29 18:14:43,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:14:43,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 18:14:43,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-29 18:14:43,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:43,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-29 18:14:43,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102456043] [2020-11-29 18:14:43,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 18:14:43,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 18:14:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 18:14:43,785 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-11-29 18:14:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:44,058 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2020-11-29 18:14:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 18:14:44,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-11-29 18:14:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:44,060 INFO L225 Difference]: With dead ends: 68 [2020-11-29 18:14:44,060 INFO L226 Difference]: Without dead ends: 35 [2020-11-29 18:14:44,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-11-29 18:14:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-29 18:14:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-29 18:14:44,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-29 18:14:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-11-29 18:14:44,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2020-11-29 18:14:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:44,075 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-11-29 18:14:44,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 18:14:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-11-29 18:14:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-29 18:14:44,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:44,085 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:44,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:14:44,308 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1356719978, now seen corresponding path program 3 times [2020-11-29 18:14:44,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:44,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457586107] [2020-11-29 18:14:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-29 18:14:44,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457586107] [2020-11-29 18:14:44,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172396173] [2020-11-29 18:14:44,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:44,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-29 18:14:44,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:14:44,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 18:14:44,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-11-29 18:14:44,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:44,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-11-29 18:14:44,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838404038] [2020-11-29 18:14:44,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 18:14:44,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:44,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 18:14:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:14:44,729 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 10 states. [2020-11-29 18:14:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:44,936 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2020-11-29 18:14:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 18:14:44,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-11-29 18:14:44,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:44,940 INFO L225 Difference]: With dead ends: 84 [2020-11-29 18:14:44,940 INFO L226 Difference]: Without dead ends: 47 [2020-11-29 18:14:44,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-11-29 18:14:44,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-29 18:14:44,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-11-29 18:14:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-29 18:14:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-11-29 18:14:44,959 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2020-11-29 18:14:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:44,962 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-11-29 18:14:44,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 18:14:44,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2020-11-29 18:14:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-29 18:14:44,970 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:44,971 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:45,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:14:45,196 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:45,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:45,197 INFO L82 PathProgramCache]: Analyzing trace with hash 876254947, now seen corresponding path program 4 times [2020-11-29 18:14:45,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:45,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469420331] [2020-11-29 18:14:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:45,475 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-11-29 18:14:45,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469420331] [2020-11-29 18:14:45,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280638794] [2020-11-29 18:14:45,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:45,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-29 18:14:45,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:14:45,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-29 18:14:45,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-11-29 18:14:45,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:45,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-29 18:14:45,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396919348] [2020-11-29 18:14:45,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 18:14:45,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 18:14:45,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:14:45,680 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 10 states. [2020-11-29 18:14:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:45,918 INFO L93 Difference]: Finished difference Result 114 states and 173 transitions. [2020-11-29 18:14:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-29 18:14:45,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2020-11-29 18:14:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:45,922 INFO L225 Difference]: With dead ends: 114 [2020-11-29 18:14:45,922 INFO L226 Difference]: Without dead ends: 110 [2020-11-29 18:14:45,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-11-29 18:14:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-29 18:14:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-11-29 18:14:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-29 18:14:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-11-29 18:14:45,953 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 106 [2020-11-29 18:14:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:45,954 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-11-29 18:14:45,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 18:14:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-11-29 18:14:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-29 18:14:45,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:45,959 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:46,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-29 18:14:46,160 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1600878918, now seen corresponding path program 5 times [2020-11-29 18:14:46,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:46,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780751375] [2020-11-29 18:14:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-29 18:14:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-11-29 18:14:46,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780751375] [2020-11-29 18:14:46,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690380426] [2020-11-29 18:14:46,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:46,919 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2020-11-29 18:14:46,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:14:46,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-29 18:14:46,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 476 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2020-11-29 18:14:47,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:47,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2020-11-29 18:14:47,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233513237] [2020-11-29 18:14:47,160 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-29 18:14:47,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-29 18:14:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-11-29 18:14:47,161 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 18 states. [2020-11-29 18:14:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:47,869 INFO L93 Difference]: Finished difference Result 187 states and 337 transitions. [2020-11-29 18:14:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-29 18:14:47,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2020-11-29 18:14:47,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:47,872 INFO L225 Difference]: With dead ends: 187 [2020-11-29 18:14:47,872 INFO L226 Difference]: Without dead ends: 89 [2020-11-29 18:14:47,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2020-11-29 18:14:47,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-29 18:14:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2020-11-29 18:14:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-29 18:14:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2020-11-29 18:14:47,894 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 201 [2020-11-29 18:14:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:47,895 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2020-11-29 18:14:47,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-29 18:14:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2020-11-29 18:14:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-29 18:14:47,898 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:47,900 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:48,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:14:48,104 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1830568536, now seen corresponding path program 6 times [2020-11-29 18:14:48,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:48,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133046953] [2020-11-29 18:14:48,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-29 18:14:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-11-29 18:14:48,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133046953] [2020-11-29 18:14:48,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293319928] [2020-11-29 18:14:48,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:48,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-11-29 18:14:48,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-29 18:14:48,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-29 18:14:48,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-11-29 18:14:48,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:48,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-29 18:14:48,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117732741] [2020-11-29 18:14:48,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 18:14:48,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 18:14:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-29 18:14:48,656 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 11 states. [2020-11-29 18:14:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:48,881 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2020-11-29 18:14:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-29 18:14:48,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2020-11-29 18:14:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:48,884 INFO L225 Difference]: With dead ends: 82 [2020-11-29 18:14:48,884 INFO L226 Difference]: Without dead ends: 78 [2020-11-29 18:14:48,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-11-29 18:14:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-29 18:14:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-29 18:14:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-29 18:14:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2020-11-29 18:14:48,901 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 174 [2020-11-29 18:14:48,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:48,902 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2020-11-29 18:14:48,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 18:14:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2020-11-29 18:14:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-11-29 18:14:48,908 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:48,908 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:49,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 18:14:49,124 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 267357610, now seen corresponding path program 7 times [2020-11-29 18:14:49,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:49,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303547627] [2020-11-29 18:14:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-29 18:14:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-29 18:14:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-29 18:14:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-29 18:14:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-29 18:14:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-29 18:14:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-29 18:14:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-29 18:14:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-11-29 18:14:49,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303547627] [2020-11-29 18:14:49,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490915038] [2020-11-29 18:14:49,740 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/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 [2020-11-29 18:14:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:14:49,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-29 18:14:49,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 18:14:50,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-11-29 18:14:50,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 18:14:50,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-29 18:14:50,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043850249] [2020-11-29 18:14:50,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 18:14:50,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:14:50,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 18:14:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-29 18:14:50,010 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 12 states. [2020-11-29 18:14:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:14:50,354 INFO L93 Difference]: Finished difference Result 260 states and 386 transitions. [2020-11-29 18:14:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 18:14:50,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 283 [2020-11-29 18:14:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:14:50,361 INFO L225 Difference]: With dead ends: 260 [2020-11-29 18:14:50,361 INFO L226 Difference]: Without dead ends: 256 [2020-11-29 18:14:50,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-11-29 18:14:50,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-29 18:14:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2020-11-29 18:14:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-29 18:14:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-11-29 18:14:50,400 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 358 transitions. Word has length 283 [2020-11-29 18:14:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:14:50,404 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-11-29 18:14:50,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 18:14:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 358 transitions. [2020-11-29 18:14:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-11-29 18:14:50,414 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:14:50,415 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:14:50,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-29 18:14:50,629 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:14:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:14:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1142305995, now seen corresponding path program 8 times [2020-11-29 18:14:50,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:14:50,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341239476] [2020-11-29 18:14:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:14:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:14:50,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:14:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:14:50,819 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:14:51,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:14:51,006 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:14:51,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 18:14:51,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:14:51 BoogieIcfgContainer [2020-11-29 18:14:51,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:14:51,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:14:51,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:14:51,225 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:14:51,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:14:41" (3/4) ... [2020-11-29 18:14:51,228 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:14:51,403 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e7a38605-adc1-4fc1-a8b1-1a8aca357b7f/bin/uautomizer/witness.graphml [2020-11-29 18:14:51,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:14:51,405 INFO L168 Benchmark]: Toolchain (without parser) took 10622.18 ms. Allocated memory was 100.7 MB in the beginning and 226.5 MB in the end (delta: 125.8 MB). Free memory was 73.9 MB in the beginning and 138.9 MB in the end (delta: -65.0 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,406 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 100.7 MB. Free memory was 59.9 MB in the beginning and 59.9 MB in the end (delta: 52.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:14:51,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.93 ms. Allocated memory is still 100.7 MB. Free memory was 73.7 MB in the beginning and 76.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.89 ms. Allocated memory is still 100.7 MB. Free memory was 76.7 MB in the beginning and 75.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:14:51,407 INFO L168 Benchmark]: Boogie Preprocessor took 17.39 ms. Allocated memory is still 100.7 MB. Free memory was 75.3 MB in the beginning and 74.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,408 INFO L168 Benchmark]: RCFGBuilder took 330.15 ms. Allocated memory is still 100.7 MB. Free memory was 74.3 MB in the beginning and 63.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,408 INFO L168 Benchmark]: TraceAbstraction took 9831.69 ms. Allocated memory was 100.7 MB in the beginning and 226.5 MB in the end (delta: 125.8 MB). Free memory was 62.5 MB in the beginning and 158.8 MB in the end (delta: -96.2 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,409 INFO L168 Benchmark]: Witness Printer took 178.88 ms. Allocated memory is still 226.5 MB. Free memory was 157.7 MB in the beginning and 138.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:14:51,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 100.7 MB. Free memory was 59.9 MB in the beginning and 59.9 MB in the end (delta: 52.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 222.93 ms. Allocated memory is still 100.7 MB. Free memory was 73.7 MB in the beginning and 76.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 25.89 ms. Allocated memory is still 100.7 MB. Free memory was 76.7 MB in the beginning and 75.3 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 17.39 ms. Allocated memory is still 100.7 MB. Free memory was 75.3 MB in the beginning and 74.3 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 330.15 ms. Allocated memory is still 100.7 MB. Free memory was 74.3 MB in the beginning and 63.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9831.69 ms. Allocated memory was 100.7 MB in the beginning and 226.5 MB in the end (delta: 125.8 MB). Free memory was 62.5 MB in the beginning and 158.8 MB in the end (delta: -96.2 MB). Peak memory consumption was 104.0 MB. Max. memory is 16.1 GB. * Witness Printer took 178.88 ms. Allocated memory is still 226.5 MB. Free memory was 157.7 MB in the beginning and 138.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.5s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 163 SDtfs, 429 SDslu, 448 SDs, 0 SdLazy, 1010 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1175 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 43 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2307 NumberOfCodeBlocks, 2250 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 503397 SizeOfPredicates, 43 NumberOfNonLiveVariables, 2124 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 13801/18588 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...