./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_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:15,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:05:15,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:05:15,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:05:15,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:05:15,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:05:15,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:05:15,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:05:15,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:05:15,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:05:15,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:05:15,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:05:15,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:05:15,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:05:15,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:05:15,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:05:15,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:05:15,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:05:15,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:05:15,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:05:15,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:05:15,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:05:15,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:05:15,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:05:15,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:05:15,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:05:15,434 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:05:15,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:05:15,436 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:05:15,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:05:15,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:05:15,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:05:15,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:05:15,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:05:15,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:05:15,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:05:15,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:05:15,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:05:15,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:05:15,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:05:15,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:05:15,450 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:05:15,491 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:05:15,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:05:15,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:05:15,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:05:15,494 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:05:15,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:05:15,495 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:05:15,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:05:15,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:05:15,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:05:15,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:05:15,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:05:15,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:05:15,497 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:05:15,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:05:15,498 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:05:15,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:05:15,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:05:15,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:05:15,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:05:15,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:05:15,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:05:15,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:05:15,500 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:05:15,500 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:05:15,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:05:15,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:05:15,501 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:05:15,501 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:05:15,501 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_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:15,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:05:15,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:05:15,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:05:15,788 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:05:15,797 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:05:15,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-28 03:05:15,865 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/data/e457b1f4d/7a673c30c9834d4bb23591a1ad3e7d35/FLAGc7f9f2e1e [2020-11-28 03:05:16,303 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:05:16,304 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/sv-benchmarks/c/recursive/Fibonacci05.c [2020-11-28 03:05:16,313 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/data/e457b1f4d/7a673c30c9834d4bb23591a1ad3e7d35/FLAGc7f9f2e1e [2020-11-28 03:05:16,690 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/data/e457b1f4d/7a673c30c9834d4bb23591a1ad3e7d35 [2020-11-28 03:05:16,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:05:16,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:05:16,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:05:16,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:05:16,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:05:16,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5880f14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16, skipping insertion in model container [2020-11-28 03:05:16,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:05:16,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:05:16,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:05:16,894 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:05:16,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:05:16,924 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:05:16,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16 WrapperNode [2020-11-28 03:05:16,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:05:16,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:05:16,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:05:16,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:05:16,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:05:16,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:05:16,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:05:16,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:05:16,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... [2020-11-28 03:05:16,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:05:16,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:05:16,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:05:16,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:05:16,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-28 03:05:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-28 03:05:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:05:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:05:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:05:17,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:05:17,346 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:05:17,346 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-28 03:05:17,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:17 BoogieIcfgContainer [2020-11-28 03:05:17,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:05:17,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:05:17,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:05:17,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:05:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:05:16" (1/3) ... [2020-11-28 03:05:17,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b878a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:17, skipping insertion in model container [2020-11-28 03:05:17,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:16" (2/3) ... [2020-11-28 03:05:17,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b878a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:05:17, skipping insertion in model container [2020-11-28 03:05:17,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:17" (3/3) ... [2020-11-28 03:05:17,355 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-28 03:05:17,367 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:05:17,371 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-28 03:05:17,385 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-28 03:05:17,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:05:17,409 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:05:17,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:05:17,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:05:17,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:05:17,410 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:05:17,410 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:05:17,410 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:05:17,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-11-28 03:05:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 03:05:17,427 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:17,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:17,428 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:17,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash -691997320, now seen corresponding path program 1 times [2020-11-28 03:05:17,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:17,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301248679] [2020-11-28 03:05:17,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:17,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:17,698 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-28 03:05:17,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301248679] [2020-11-28 03:05:17,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:17,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:05:17,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712378533] [2020-11-28 03:05:17,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:05:17,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:05:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:17,720 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-11-28 03:05:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:17,838 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2020-11-28 03:05:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:05:17,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-28 03:05:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:17,848 INFO L225 Difference]: With dead ends: 32 [2020-11-28 03:05:17,848 INFO L226 Difference]: Without dead ends: 18 [2020-11-28 03:05:17,851 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-28 03:05:17,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-11-28 03:05:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-28 03:05:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-28 03:05:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-28 03:05:17,891 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-11-28 03:05:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:17,891 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-28 03:05:17,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:05:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-28 03:05:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 03:05:17,894 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:17,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:05:17,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:05:17,895 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:17,896 INFO L82 PathProgramCache]: Analyzing trace with hash 717045018, now seen corresponding path program 1 times [2020-11-28 03:05:17,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:17,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738807128] [2020-11-28 03:05:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:17,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,021 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-28 03:05:18,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738807128] [2020-11-28 03:05:18,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:05:18,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:05:18,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140695170] [2020-11-28 03:05:18,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:05:18,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:18,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:05:18,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:05:18,025 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-11-28 03:05:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:18,096 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-11-28 03:05:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:05:18,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-28 03:05:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:18,099 INFO L225 Difference]: With dead ends: 24 [2020-11-28 03:05:18,099 INFO L226 Difference]: Without dead ends: 20 [2020-11-28 03:05:18,100 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-28 03:05:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-28 03:05:18,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-11-28 03:05:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-28 03:05:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-28 03:05:18,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-11-28 03:05:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:18,106 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-28 03:05:18,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:05:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-28 03:05:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:05:18,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:18,107 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-28 03:05:18,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:05:18,108 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1426922965, now seen corresponding path program 1 times [2020-11-28 03:05:18,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:18,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732268615] [2020-11-28 03:05:18,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-28 03:05:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,247 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-28 03:05:18,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732268615] [2020-11-28 03:05:18,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606873086] [2020-11-28 03:05:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:05:18,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:18,444 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-28 03:05:18,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:18,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-28 03:05:18,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138804474] [2020-11-28 03:05:18,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:05:18,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:18,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:05:18,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:05:18,447 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-11-28 03:05:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:18,613 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-11-28 03:05:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:05:18,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-28 03:05:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:18,615 INFO L225 Difference]: With dead ends: 35 [2020-11-28 03:05:18,615 INFO L226 Difference]: Without dead ends: 20 [2020-11-28 03:05:18,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:05:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-28 03:05:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-28 03:05:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-28 03:05:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-11-28 03:05:18,626 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-11-28 03:05:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:18,627 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-28 03:05:18,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:05:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-11-28 03:05:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 03:05:18,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:18,631 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-28 03:05:18,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-28 03:05:18,853 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:18,854 INFO L82 PathProgramCache]: Analyzing trace with hash 301752507, now seen corresponding path program 1 times [2020-11-28 03:05:18,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:18,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279321532] [2020-11-28 03:05:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:18,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,015 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-28 03:05:19,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279321532] [2020-11-28 03:05:19,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677002981] [2020-11-28 03:05:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-28 03:05:19,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:19,130 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-28 03:05:19,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:19,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-28 03:05:19,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947600688] [2020-11-28 03:05:19,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:05:19,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:19,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:05:19,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:05:19,133 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-11-28 03:05:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:19,261 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-11-28 03:05:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:05:19,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-28 03:05:19,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:19,264 INFO L225 Difference]: With dead ends: 38 [2020-11-28 03:05:19,264 INFO L226 Difference]: Without dead ends: 34 [2020-11-28 03:05:19,267 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-28 03:05:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-28 03:05:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-28 03:05:19,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-28 03:05:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-11-28 03:05:19,282 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-11-28 03:05:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:19,283 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-11-28 03:05:19,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:05:19,283 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-11-28 03:05:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-28 03:05:19,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:19,287 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-28 03:05:19,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:05:19,513 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1093063438, now seen corresponding path program 2 times [2020-11-28 03:05:19,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:19,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908211231] [2020-11-28 03:05:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:19,680 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-28 03:05:19,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908211231] [2020-11-28 03:05:19,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428120194] [2020-11-28 03:05:19,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:19,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-28 03:05:19,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:05:19,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 03:05:19,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:19,891 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-28 03:05:19,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:19,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-28 03:05:19,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611630973] [2020-11-28 03:05:19,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-28 03:05:19,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:19,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 03:05:19,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:05:19,894 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-11-28 03:05:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:20,226 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2020-11-28 03:05:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:05:20,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-11-28 03:05:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:20,228 INFO L225 Difference]: With dead ends: 68 [2020-11-28 03:05:20,232 INFO L226 Difference]: Without dead ends: 35 [2020-11-28 03:05:20,233 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-28 03:05:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-28 03:05:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-28 03:05:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-28 03:05:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-11-28 03:05:20,240 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2020-11-28 03:05:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:20,241 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-11-28 03:05:20,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-28 03:05:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-11-28 03:05:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-28 03:05:20,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:20,243 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-28 03:05:20,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:05:20,451 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1356719978, now seen corresponding path program 3 times [2020-11-28 03:05:20,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:20,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393042400] [2020-11-28 03:05:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:20,713 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-28 03:05:20,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393042400] [2020-11-28 03:05:20,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656776653] [2020-11-28 03:05:20,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:20,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-28 03:05:20,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:05:20,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-28 03:05:20,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:20,861 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-28 03:05:20,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:20,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-11-28 03:05:20,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871959036] [2020-11-28 03:05:20,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-28 03:05:20,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:05:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:05:20,864 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 10 states. [2020-11-28 03:05:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:21,082 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2020-11-28 03:05:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 03:05:21,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-11-28 03:05:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:21,085 INFO L225 Difference]: With dead ends: 84 [2020-11-28 03:05:21,085 INFO L226 Difference]: Without dead ends: 47 [2020-11-28 03:05:21,086 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-28 03:05:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-28 03:05:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-11-28 03:05:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-28 03:05:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-11-28 03:05:21,098 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2020-11-28 03:05:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:21,099 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-11-28 03:05:21,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-28 03:05:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2020-11-28 03:05:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-28 03:05:21,101 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:21,102 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-28 03:05:21,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:05:21,323 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 876254947, now seen corresponding path program 4 times [2020-11-28 03:05:21,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:21,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568225214] [2020-11-28 03:05:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:21,682 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-28 03:05:21,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568225214] [2020-11-28 03:05:21,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014223008] [2020-11-28 03:05:21,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:21,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-28 03:05:21,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:05:21,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-28 03:05:21,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:21,866 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-28 03:05:21,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:21,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-11-28 03:05:21,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597116255] [2020-11-28 03:05:21,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-28 03:05:21,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:21,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-28 03:05:21,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:05:21,876 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 10 states. [2020-11-28 03:05:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:22,121 INFO L93 Difference]: Finished difference Result 114 states and 173 transitions. [2020-11-28 03:05:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-28 03:05:22,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2020-11-28 03:05:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:22,130 INFO L225 Difference]: With dead ends: 114 [2020-11-28 03:05:22,131 INFO L226 Difference]: Without dead ends: 110 [2020-11-28 03:05:22,132 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-28 03:05:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-28 03:05:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2020-11-28 03:05:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-28 03:05:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2020-11-28 03:05:22,177 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 106 [2020-11-28 03:05:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:22,178 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2020-11-28 03:05:22,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-28 03:05:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2020-11-28 03:05:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-28 03:05:22,187 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:22,187 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-28 03:05:22,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-28 03:05:22,388 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1600878918, now seen corresponding path program 5 times [2020-11-28 03:05:22,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:22,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796360728] [2020-11-28 03:05:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:05:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:22,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:23,045 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-28 03:05:23,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796360728] [2020-11-28 03:05:23,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253984086] [2020-11-28 03:05:23,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:23,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2020-11-28 03:05:23,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:05:23,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-28 03:05:23,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:23,395 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-28 03:05:23,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:23,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2020-11-28 03:05:23,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388391670] [2020-11-28 03:05:23,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-28 03:05:23,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:23,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-28 03:05:23,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-11-28 03:05:23,398 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand 18 states. [2020-11-28 03:05:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:24,178 INFO L93 Difference]: Finished difference Result 187 states and 337 transitions. [2020-11-28 03:05:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-28 03:05:24,181 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2020-11-28 03:05:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:24,183 INFO L225 Difference]: With dead ends: 187 [2020-11-28 03:05:24,183 INFO L226 Difference]: Without dead ends: 89 [2020-11-28 03:05:24,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=303, Invalid=1029, Unknown=0, NotChecked=0, Total=1332 [2020-11-28 03:05:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-28 03:05:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2020-11-28 03:05:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-28 03:05:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2020-11-28 03:05:24,200 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 201 [2020-11-28 03:05:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:24,201 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2020-11-28 03:05:24,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-28 03:05:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2020-11-28 03:05:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-11-28 03:05:24,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:24,203 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-28 03:05:24,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:05:24,404 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1830568536, now seen corresponding path program 6 times [2020-11-28 03:05:24,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:24,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095074045] [2020-11-28 03:05:24,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:05:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:24,903 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-28 03:05:24,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095074045] [2020-11-28 03:05:24,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899096670] [2020-11-28 03:05:24,903 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:25,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-11-28 03:05:25,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-28 03:05:25,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-28 03:05:25,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:25,147 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-28 03:05:25,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:25,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-28 03:05:25,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976502759] [2020-11-28 03:05:25,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 03:05:25,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:05:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:05:25,153 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand 11 states. [2020-11-28 03:05:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:25,377 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2020-11-28 03:05:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:05:25,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 174 [2020-11-28 03:05:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:25,379 INFO L225 Difference]: With dead ends: 82 [2020-11-28 03:05:25,379 INFO L226 Difference]: Without dead ends: 78 [2020-11-28 03:05:25,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-11-28 03:05:25,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-28 03:05:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-11-28 03:05:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-28 03:05:25,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2020-11-28 03:05:25,393 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 174 [2020-11-28 03:05:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:25,394 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2020-11-28 03:05:25,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 03:05:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2020-11-28 03:05:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-11-28 03:05:25,399 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:25,399 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-28 03:05:25,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:05:25,625 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:25,626 INFO L82 PathProgramCache]: Analyzing trace with hash 267357610, now seen corresponding path program 7 times [2020-11-28 03:05:25,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:25,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109527719] [2020-11-28 03:05:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-28 03:05:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:25,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-28 03:05:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-28 03:05:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-28 03:05:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-28 03:05:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-28 03:05:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-28 03:05:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-28 03:05:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,330 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-28 03:05:26,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109527719] [2020-11-28 03:05:26,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528108591] [2020-11-28 03:05:26,331 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/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-28 03:05:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:05:26,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 16 conjunts are in the unsatisfiable core [2020-11-28 03:05:26,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:05:26,618 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-28 03:05:26,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:05:26,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2020-11-28 03:05:26,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992900485] [2020-11-28 03:05:26,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-28 03:05:26,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:05:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-28 03:05:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:05:26,621 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 12 states. [2020-11-28 03:05:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:05:26,973 INFO L93 Difference]: Finished difference Result 260 states and 386 transitions. [2020-11-28 03:05:26,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-28 03:05:26,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 283 [2020-11-28 03:05:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:05:26,981 INFO L225 Difference]: With dead ends: 260 [2020-11-28 03:05:26,984 INFO L226 Difference]: Without dead ends: 256 [2020-11-28 03:05:26,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-11-28 03:05:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-11-28 03:05:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 241. [2020-11-28 03:05:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-11-28 03:05:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 358 transitions. [2020-11-28 03:05:27,063 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 358 transitions. Word has length 283 [2020-11-28 03:05:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:05:27,065 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 358 transitions. [2020-11-28 03:05:27,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-28 03:05:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 358 transitions. [2020-11-28 03:05:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-11-28 03:05:27,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:05:27,077 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-28 03:05:27,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-28 03:05:27,297 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:05:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:05:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1142305995, now seen corresponding path program 8 times [2020-11-28 03:05:27,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:05:27,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741395962] [2020-11-28 03:05:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:05:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:05:27,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:05:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:05:27,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:05:27,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:05:27,692 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:05:27,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:05:27,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:05:27 BoogieIcfgContainer [2020-11-28 03:05:27,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:05:27,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:05:27,908 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:05:27,909 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:05:27,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:17" (3/4) ... [2020-11-28 03:05:27,911 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:05:28,078 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0cc18f55-30b8-4623-bbad-d3c1c1dfebc4/bin/uautomizer/witness.graphml [2020-11-28 03:05:28,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:05:28,080 INFO L168 Benchmark]: Toolchain (without parser) took 11384.86 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 60.0 MB in the beginning and 102.0 MB in the end (delta: -42.0 MB). Peak memory consumption was 100.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,081 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 90.2 MB. Free memory is still 47.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:05:28,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.96 ms. Allocated memory is still 90.2 MB. Free memory was 59.8 MB in the beginning and 67.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.73 ms. Allocated memory is still 90.2 MB. Free memory was 67.7 MB in the beginning and 66.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:05:28,082 INFO L168 Benchmark]: Boogie Preprocessor took 17.34 ms. Allocated memory is still 90.2 MB. Free memory was 66.5 MB in the beginning and 65.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,083 INFO L168 Benchmark]: RCFGBuilder took 371.07 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 54.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,083 INFO L168 Benchmark]: TraceAbstraction took 10559.16 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 53.7 MB in the beginning and 121.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,083 INFO L168 Benchmark]: Witness Printer took 170.01 ms. Allocated memory is still 232.8 MB. Free memory was 121.9 MB in the beginning and 102.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:05:28,085 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.19 ms. Allocated memory is still 90.2 MB. Free memory is still 47.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 229.96 ms. Allocated memory is still 90.2 MB. Free memory was 59.8 MB in the beginning and 67.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.73 ms. Allocated memory is still 90.2 MB. Free memory was 67.7 MB in the beginning and 66.5 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 17.34 ms. Allocated memory is still 90.2 MB. Free memory was 66.5 MB in the beginning and 65.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 371.07 ms. Allocated memory is still 90.2 MB. Free memory was 65.3 MB in the beginning and 54.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10559.16 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 53.7 MB in the beginning and 121.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.1 GB. * Witness Printer took 170.01 ms. Allocated memory is still 232.8 MB. Free memory was 121.9 MB in the beginning and 102.0 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 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: 10.2s, OverallIterations: 11, TraceHistogramMax: 67, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 163 SDtfs, 429 SDslu, 448 SDs, 0 SdLazy, 1013 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1314 GetRequests, 1175 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.0s 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 43 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.7s 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...