./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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 b2c28e4a28eb31322d66c263b5716511ec5353f2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:26:54,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:26:54,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:26:54,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:26:54,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:26:54,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:26:54,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:26:54,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:26:54,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:26:54,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:26:54,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:26:54,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:26:54,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:26:54,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:26:54,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:26:54,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:26:54,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:26:54,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:26:54,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:26:54,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:26:54,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:26:54,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:26:54,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:26:54,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:26:54,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:26:54,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:26:54,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:26:54,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:26:54,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:26:54,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:26:54,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:26:54,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:26:54,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:26:54,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:26:54,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:26:54,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:26:54,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:26:54,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:26:54,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:26:54,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:26:54,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:26:54,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:26:54,630 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:26:54,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:26:54,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:26:54,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:26:54,633 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:26:54,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:26:54,633 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:26:54,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:26:54,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:26:54,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:26:54,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:26:54,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:26:54,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:26:54,636 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:26:54,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:26:54,637 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:26:54,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:26:54,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:26:54,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:26:54,638 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:26:54,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:26:54,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:26:54,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:26:54,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:26:54,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:26:54,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:26:54,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:26:54,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:26:54,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:26:54,641 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_4340223f-376c-408d-b804-47105b1a493a/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_4340223f-376c-408d-b804-47105b1a493a/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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2020-11-30 01:26:54,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:26:54,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:26:54,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:26:54,943 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:26:54,945 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:26:54,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-11-30 01:26:55,033 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/data/3388809d3/f763f366b24a456bbc2556df5b1a5242/FLAG02f22b44a [2020-11-30 01:26:55,631 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:26:55,631 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-11-30 01:26:55,638 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/data/3388809d3/f763f366b24a456bbc2556df5b1a5242/FLAG02f22b44a [2020-11-30 01:26:56,010 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/data/3388809d3/f763f366b24a456bbc2556df5b1a5242 [2020-11-30 01:26:56,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:26:56,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:26:56,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:56,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:26:56,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:26:56,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7f152a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56, skipping insertion in model container [2020-11-30 01:26:56,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:26:56,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:26:56,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:56,305 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:26:56,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:26:56,338 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:26:56,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56 WrapperNode [2020-11-30 01:26:56,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:26:56,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:26:56,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:26:56,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:26:56,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:26:56,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:26:56,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:26:56,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:26:56,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... [2020-11-30 01:26:56,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:26:56,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:26:56,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:26:56,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:26:56,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:26:56,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:26:56,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:26:56,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:26:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:26:56,480 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-30 01:26:56,480 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-30 01:26:56,887 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:26:56,889 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:26:56,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:26:56 BoogieIcfgContainer [2020-11-30 01:26:56,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:26:56,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:26:56,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:26:56,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:26:56,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:26:56" (1/3) ... [2020-11-30 01:26:56,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3bc124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:26:56, skipping insertion in model container [2020-11-30 01:26:56,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:26:56" (2/3) ... [2020-11-30 01:26:56,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3bc124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:26:56, skipping insertion in model container [2020-11-30 01:26:56,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:26:56" (3/3) ... [2020-11-30 01:26:56,908 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-11-30 01:26:56,922 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:26:56,927 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:26:56,942 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:26:56,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:26:56,985 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:26:56,985 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:26:56,985 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:26:56,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:26:56,986 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:26:56,986 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:26:56,986 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:26:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-11-30 01:26:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:26:57,022 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:57,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:57,024 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash -730685886, now seen corresponding path program 1 times [2020-11-30 01:26:57,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:57,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136216963] [2020-11-30 01:26:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:26:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,347 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-30 01:26:57,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136216963] [2020-11-30 01:26:57,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:26:57,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:26:57,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051855918] [2020-11-30 01:26:57,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:26:57,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:26:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:26:57,380 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-11-30 01:26:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:57,449 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-11-30 01:26:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:26:57,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-30 01:26:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:57,461 INFO L225 Difference]: With dead ends: 35 [2020-11-30 01:26:57,461 INFO L226 Difference]: Without dead ends: 18 [2020-11-30 01:26:57,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:26:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-11-30 01:26:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-11-30 01:26:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 01:26:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-30 01:26:57,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-11-30 01:26:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:57,509 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-30 01:26:57,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:26:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-30 01:26:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:26:57,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:57,512 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:26:57,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:26:57,512 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:57,513 INFO L82 PathProgramCache]: Analyzing trace with hash -461623668, now seen corresponding path program 1 times [2020-11-30 01:26:57,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:57,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520224899] [2020-11-30 01:26:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:26:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,635 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-30 01:26:57,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520224899] [2020-11-30 01:26:57,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:26:57,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 01:26:57,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727467553] [2020-11-30 01:26:57,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:26:57,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:26:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:26:57,639 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-11-30 01:26:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:57,673 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-11-30 01:26:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:26:57,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-30 01:26:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:57,676 INFO L225 Difference]: With dead ends: 24 [2020-11-30 01:26:57,676 INFO L226 Difference]: Without dead ends: 20 [2020-11-30 01:26:57,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 01:26:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-30 01:26:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-11-30 01:26:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-11-30 01:26:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-11-30 01:26:57,683 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-11-30 01:26:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:57,683 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-11-30 01:26:57,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:26:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-11-30 01:26:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 01:26:57,687 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:57,688 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-30 01:26:57,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 01:26:57,689 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1253239047, now seen corresponding path program 1 times [2020-11-30 01:26:57,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:57,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622884613] [2020-11-30 01:26:57,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:26:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:26:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-30 01:26:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,882 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-30 01:26:57,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622884613] [2020-11-30 01:26:57,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514945] [2020-11-30 01:26:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:26:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:57,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:26:57,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:58,149 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-30 01:26:58,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:58,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-11-30 01:26:58,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092023049] [2020-11-30 01:26:58,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-30 01:26:58,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-30 01:26:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:26:58,158 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-11-30 01:26:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:58,338 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-11-30 01:26:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:26:58,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-11-30 01:26:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:58,340 INFO L225 Difference]: With dead ends: 35 [2020-11-30 01:26:58,340 INFO L226 Difference]: Without dead ends: 20 [2020-11-30 01:26:58,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-30 01:26:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-30 01:26:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-30 01:26:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-30 01:26:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-11-30 01:26:58,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-11-30 01:26:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:58,348 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-11-30 01:26:58,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-30 01:26:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-11-30 01:26:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-30 01:26:58,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:58,350 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-30 01:26:58,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-30 01:26:58,569 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1685451365, now seen corresponding path program 1 times [2020-11-30 01:26:58,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:58,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373584066] [2020-11-30 01:26:58,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:26:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:26:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:26:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,736 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-30 01:26:58,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373584066] [2020-11-30 01:26:58,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099830643] [2020-11-30 01:26:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:26:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:58,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:26:58,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:58,856 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-30 01:26:58,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:58,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-11-30 01:26:58,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488594999] [2020-11-30 01:26:58,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 01:26:58,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 01:26:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-30 01:26:58,862 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-11-30 01:26:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:59,031 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-11-30 01:26:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:26:59,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-30 01:26:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:59,035 INFO L225 Difference]: With dead ends: 38 [2020-11-30 01:26:59,035 INFO L226 Difference]: Without dead ends: 34 [2020-11-30 01:26:59,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-30 01:26:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-30 01:26:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-30 01:26:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-30 01:26:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-11-30 01:26:59,063 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-11-30 01:26:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:59,063 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-11-30 01:26:59,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 01:26:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-11-30 01:26:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-11-30 01:26:59,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:59,065 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-30 01:26:59,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:26:59,292 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 228714308, now seen corresponding path program 2 times [2020-11-30 01:26:59,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:26:59,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135190951] [2020-11-30 01:26:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:26:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:26:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:26:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:26:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:26:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:26:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:26:59,535 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-30 01:26:59,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135190951] [2020-11-30 01:26:59,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605953541] [2020-11-30 01:26:59,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:26:59,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:26:59,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:26:59,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:26:59,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:59,774 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-30 01:26:59,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:59,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-11-30 01:26:59,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339028365] [2020-11-30 01:26:59,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-30 01:26:59,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:26:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-30 01:26:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-30 01:26:59,777 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-11-30 01:27:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:00,107 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-11-30 01:27:00,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-30 01:27:00,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-11-30 01:27:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:00,110 INFO L225 Difference]: With dead ends: 69 [2020-11-30 01:27:00,110 INFO L226 Difference]: Without dead ends: 38 [2020-11-30 01:27:00,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-11-30 01:27:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-11-30 01:27:00,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-11-30 01:27:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-11-30 01:27:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-11-30 01:27:00,119 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-11-30 01:27:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:00,121 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-11-30 01:27:00,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-30 01:27:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-11-30 01:27:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-11-30 01:27:00,131 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:00,131 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:00,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:00,355 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:00,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1825869943, now seen corresponding path program 3 times [2020-11-30 01:27:00,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:00,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419303033] [2020-11-30 01:27:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:27:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-11-30 01:27:00,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419303033] [2020-11-30 01:27:00,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874470863] [2020-11-30 01:27:00,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:27:00,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-11-30 01:27:00,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:27:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-30 01:27:00,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-11-30 01:27:01,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:01,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-11-30 01:27:01,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765273569] [2020-11-30 01:27:01,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-30 01:27:01,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-30 01:27:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-30 01:27:01,028 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-11-30 01:27:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:01,322 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-11-30 01:27:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:27:01,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-11-30 01:27:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:01,328 INFO L225 Difference]: With dead ends: 94 [2020-11-30 01:27:01,328 INFO L226 Difference]: Without dead ends: 90 [2020-11-30 01:27:01,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-11-30 01:27:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-30 01:27:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-11-30 01:27:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:27:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-11-30 01:27:01,360 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-11-30 01:27:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:01,360 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-11-30 01:27:01,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-30 01:27:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-11-30 01:27:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-11-30 01:27:01,384 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:01,384 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-30 01:27:01,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:01,601 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -793137460, now seen corresponding path program 4 times [2020-11-30 01:27:01,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:01,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551180513] [2020-11-30 01:27:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:27:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:01,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-30 01:27:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-30 01:27:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-30 01:27:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:02,448 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-30 01:27:02,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551180513] [2020-11-30 01:27:02,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700535099] [2020-11-30 01:27:02,449 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:27:02,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:27:02,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:27:02,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:27:02,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-11-30 01:27:02,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:02,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-11-30 01:27:02,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334444466] [2020-11-30 01:27:02,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-30 01:27:02,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-30 01:27:02,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-30 01:27:02,767 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 17 states. [2020-11-30 01:27:03,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:03,665 INFO L93 Difference]: Finished difference Result 169 states and 322 transitions. [2020-11-30 01:27:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-30 01:27:03,666 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2020-11-30 01:27:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:03,669 INFO L225 Difference]: With dead ends: 169 [2020-11-30 01:27:03,669 INFO L226 Difference]: Without dead ends: 91 [2020-11-30 01:27:03,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-11-30 01:27:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-30 01:27:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2020-11-30 01:27:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-30 01:27:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-11-30 01:27:03,691 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 201 [2020-11-30 01:27:03,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:03,691 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-11-30 01:27:03,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-30 01:27:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-11-30 01:27:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-11-30 01:27:03,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:03,706 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:27:03,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-30 01:27:03,921 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash 207835975, now seen corresponding path program 5 times [2020-11-30 01:27:03,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:03,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956844182] [2020-11-30 01:27:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-30 01:27:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-30 01:27:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-30 01:27:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-30 01:27:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-30 01:27:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:04,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-30 01:27:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-30 01:27:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-30 01:27:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-30 01:27:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-30 01:27:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:27:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-11-30 01:27:05,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956844182] [2020-11-30 01:27:05,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73759000] [2020-11-30 01:27:05,346 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/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-30 01:27:05,550 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2020-11-30 01:27:05,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:27:05,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-30 01:27:05,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1321 proven. 1303 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2020-11-30 01:27:05,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:27:05,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2020-11-30 01:27:05,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314854764] [2020-11-30 01:27:05,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-30 01:27:05,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 01:27:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-30 01:27:05,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-11-30 01:27:05,902 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 21 states. [2020-11-30 01:27:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:07,030 INFO L93 Difference]: Finished difference Result 192 states and 332 transitions. [2020-11-30 01:27:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-11-30 01:27:07,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 351 [2020-11-30 01:27:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:07,034 INFO L225 Difference]: With dead ends: 192 [2020-11-30 01:27:07,035 INFO L226 Difference]: Without dead ends: 119 [2020-11-30 01:27:07,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2020-11-30 01:27:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-30 01:27:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-11-30 01:27:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-30 01:27:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2020-11-30 01:27:07,056 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 351 [2020-11-30 01:27:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:07,057 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2020-11-30 01:27:07,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-30 01:27:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2020-11-30 01:27:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-11-30 01:27:07,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:07,064 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-30 01:27:07,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:27:07,289 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:07,290 INFO L82 PathProgramCache]: Analyzing trace with hash 196240028, now seen corresponding path program 6 times [2020-11-30 01:27:07,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:27:07,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204337109] [2020-11-30 01:27:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:27:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:07,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:27:07,404 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:27:07,483 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:27:07,483 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:27:07,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 01:27:07,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:27:07 BoogieIcfgContainer [2020-11-30 01:27:07,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:27:07,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:27:07,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:27:07,677 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:27:07,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:26:56" (3/4) ... [2020-11-30 01:27:07,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 01:27:07,834 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4340223f-376c-408d-b804-47105b1a493a/bin/uautomizer/witness.graphml [2020-11-30 01:27:07,835 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:27:07,837 INFO L168 Benchmark]: Toolchain (without parser) took 11821.36 ms. Allocated memory was 94.4 MB in the beginning and 306.2 MB in the end (delta: 211.8 MB). Free memory was 69.7 MB in the beginning and 265.4 MB in the end (delta: -195.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,837 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 94.4 MB. Free memory is still 54.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:07,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.13 ms. Allocated memory was 94.4 MB in the beginning and 127.9 MB in the end (delta: 33.6 MB). Free memory was 69.5 MB in the beginning and 105.4 MB in the end (delta: -35.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 127.9 MB. Free memory was 105.4 MB in the beginning and 104.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:27:07,839 INFO L168 Benchmark]: Boogie Preprocessor took 20.12 ms. Allocated memory is still 127.9 MB. Free memory was 104.2 MB in the beginning and 103.4 MB in the end (delta: 858.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,840 INFO L168 Benchmark]: RCFGBuilder took 495.83 ms. Allocated memory is still 127.9 MB. Free memory was 103.1 MB in the beginning and 92.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,840 INFO L168 Benchmark]: TraceAbstraction took 10778.01 ms. Allocated memory was 127.9 MB in the beginning and 306.2 MB in the end (delta: 178.3 MB). Free memory was 91.7 MB in the beginning and 277.0 MB in the end (delta: -185.3 MB). Peak memory consumption was 159.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,841 INFO L168 Benchmark]: Witness Printer took 158.47 ms. Allocated memory is still 306.2 MB. Free memory was 277.0 MB in the beginning and 265.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:27:07,843 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.34 ms. Allocated memory is still 94.4 MB. Free memory is still 54.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 322.13 ms. Allocated memory was 94.4 MB in the beginning and 127.9 MB in the end (delta: 33.6 MB). Free memory was 69.5 MB in the beginning and 105.4 MB in the end (delta: -35.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.80 ms. Allocated memory is still 127.9 MB. Free memory was 105.4 MB in the beginning and 104.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.12 ms. Allocated memory is still 127.9 MB. Free memory was 104.2 MB in the beginning and 103.4 MB in the end (delta: 858.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 495.83 ms. Allocated memory is still 127.9 MB. Free memory was 103.1 MB in the beginning and 92.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10778.01 ms. Allocated memory was 127.9 MB in the beginning and 306.2 MB in the end (delta: 178.3 MB). Free memory was 91.7 MB in the beginning and 277.0 MB in the end (delta: -185.3 MB). Peak memory consumption was 159.4 MB. Max. memory is 16.1 GB. * Witness Printer took 158.47 ms. Allocated memory is still 306.2 MB. Free memory was 277.0 MB in the beginning and 265.4 MB in the end (delta: 11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 51, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 458 SDslu, 528 SDs, 0 SdLazy, 1086 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 919 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1642 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1437 ConstructedInterpolants, 0 QuantifiedInterpolants, 520807 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 14921/19458 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...