./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 20:32:25,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 20:32:25,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 20:32:25,993 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 20:32:25,993 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 20:32:25,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 20:32:25,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 20:32:25,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 20:32:25,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 20:32:25,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 20:32:25,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 20:32:25,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 20:32:25,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 20:32:25,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 20:32:25,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 20:32:25,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 20:32:25,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 20:32:26,000 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 20:32:26,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 20:32:26,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 20:32:26,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 20:32:26,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 20:32:26,004 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 20:32:26,004 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 20:32:26,004 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 20:32:26,005 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 20:32:26,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 20:32:26,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 20:32:26,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 20:32:26,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 20:32:26,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 20:32:26,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 20:32:26,007 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 20:32:26,007 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 20:32:26,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 20:32:26,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 20:32:26,008 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 20:32:26,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 20:32:26,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 20:32:26,015 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 20:32:26,015 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 20:32:26,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 20:32:26,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 20:32:26,016 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 20:32:26,017 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 20:32:26,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 20:32:26,017 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 20:32:26,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 20:32:26,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 20:32:26,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 20:32:26,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-12-02 20:32:26,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 20:32:26,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 20:32:26,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 20:32:26,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 20:32:26,044 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 20:32:26,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 20:32:26,078 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/data/22501c28e/321a10e6ee0744189aec61621d8ab1d5/FLAGd707454b0 [2018-12-02 20:32:26,430 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 20:32:26,431 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 20:32:26,435 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/data/22501c28e/321a10e6ee0744189aec61621d8ab1d5/FLAGd707454b0 [2018-12-02 20:32:26,815 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/data/22501c28e/321a10e6ee0744189aec61621d8ab1d5 [2018-12-02 20:32:26,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 20:32:26,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 20:32:26,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 20:32:26,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 20:32:26,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 20:32:26,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c57853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26, skipping insertion in model container [2018-12-02 20:32:26,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 20:32:26,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 20:32:26,928 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:32:26,931 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 20:32:26,939 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 20:32:26,946 INFO L195 MainTranslator]: Completed translation [2018-12-02 20:32:26,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26 WrapperNode [2018-12-02 20:32:26,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 20:32:26,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 20:32:26,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 20:32:26,947 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 20:32:26,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 20:32:26,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 20:32:26,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 20:32:26,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 20:32:26,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... [2018-12-02 20:32:26,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 20:32:26,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 20:32:26,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 20:32:26,968 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 20:32:26,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/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 [2018-12-02 20:32:27,027 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-02 20:32:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-02 20:32:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 20:32:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 20:32:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 20:32:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 20:32:27,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 20:32:27,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 20:32:27,121 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 20:32:27,121 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 20:32:27,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:27 BoogieIcfgContainer [2018-12-02 20:32:27,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 20:32:27,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 20:32:27,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 20:32:27,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 20:32:27,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:32:26" (1/3) ... [2018-12-02 20:32:27,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e37ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:27, skipping insertion in model container [2018-12-02 20:32:27,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:32:26" (2/3) ... [2018-12-02 20:32:27,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e37ccd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:32:27, skipping insertion in model container [2018-12-02 20:32:27,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:27" (3/3) ... [2018-12-02 20:32:27,128 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-12-02 20:32:27,136 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 20:32:27,141 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 20:32:27,149 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 20:32:27,166 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 20:32:27,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 20:32:27,167 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 20:32:27,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 20:32:27,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 20:32:27,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 20:32:27,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 20:32:27,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 20:32:27,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 20:32:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-02 20:32:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 20:32:27,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,185 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-12-02 20:32:27,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:27,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:27,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:32:27,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:32:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:32:27,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:27,301 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-12-02 20:32:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:27,354 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-02 20:32:27,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:32:27,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 20:32:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:27,361 INFO L225 Difference]: With dead ends: 35 [2018-12-02 20:32:27,361 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 20:32:27,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 20:32:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 20:32:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 20:32:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 20:32:27,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-12-02 20:32:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:27,387 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 20:32:27,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:32:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 20:32:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 20:32:27,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,388 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-12-02 20:32:27,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 20:32:27,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 20:32:27,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 20:32:27,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 20:32:27,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 20:32:27,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 20:32:27,423 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-12-02 20:32:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:27,455 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-02 20:32:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 20:32:27,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 20:32:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:27,456 INFO L225 Difference]: With dead ends: 27 [2018-12-02 20:32:27,456 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 20:32:27,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 20:32:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-12-02 20:32:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 20:32:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 20:32:27,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-12-02 20:32:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 20:32:27,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 20:32:27,461 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-02 20:32:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 20:32:27,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,461 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-12-02 20:32:27,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 20:32:27,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:27,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:27,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 20:32:27,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:27,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-12-02 20:32:27,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:32:27,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:32:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:32:27,571 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-12-02 20:32:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:27,652 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-12-02 20:32:27,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 20:32:27,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-02 20:32:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:27,653 INFO L225 Difference]: With dead ends: 38 [2018-12-02 20:32:27,653 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 20:32:27,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:32:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 20:32:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 20:32:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 20:32:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 20:32:27,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-12-02 20:32:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:27,659 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 20:32:27,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:32:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 20:32:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 20:32:27,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,660 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,660 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-12-02 20:32:27,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 20:32:27,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:27,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:27,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 20:32:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 20:32:27,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 20:32:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 20:32:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 20:32:27,727 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-12-02 20:32:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:27,769 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-12-02 20:32:27,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 20:32:27,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-12-02 20:32:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:27,770 INFO L225 Difference]: With dead ends: 32 [2018-12-02 20:32:27,770 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 20:32:27,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:32:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 20:32:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-02 20:32:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 20:32:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-02 20:32:27,774 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-12-02 20:32:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:27,774 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-02 20:32:27,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 20:32:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-12-02 20:32:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 20:32:27,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,775 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,776 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-12-02 20:32:27,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:27,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 20:32:27,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:27,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:27,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:32:27,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:32:27,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:27,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-02 20:32:27,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-02 20:32:27,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:32:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:32:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:27,878 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-12-02 20:32:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:27,957 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-12-02 20:32:27,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:32:27,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-12-02 20:32:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:27,958 INFO L225 Difference]: With dead ends: 42 [2018-12-02 20:32:27,958 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 20:32:27,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-02 20:32:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 20:32:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-02 20:32:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 20:32:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-12-02 20:32:27,963 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-12-02 20:32:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-12-02 20:32:27,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:32:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-12-02 20:32:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 20:32:27,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:27,965 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:27,965 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:27,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:27,966 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-12-02 20:32:27,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:27,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-02 20:32:28,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:28,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 20:32:28,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 20:32:28,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:28,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-12-02 20:32:28,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:28,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-12-02 20:32:28,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 20:32:28,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 20:32:28,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:32:28,155 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-12-02 20:32:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:28,306 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-12-02 20:32:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:32:28,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-02 20:32:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:28,308 INFO L225 Difference]: With dead ends: 76 [2018-12-02 20:32:28,308 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 20:32:28,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-02 20:32:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 20:32:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 20:32:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 20:32:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-12-02 20:32:28,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-12-02 20:32:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:28,318 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-12-02 20:32:28,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 20:32:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-12-02 20:32:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 20:32:28,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:28,320 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:28,320 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-12-02 20:32:28,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-02 20:32:28,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:28,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:28,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 20:32:28,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 20:32:28,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:28,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 20:32:28,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:28,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-12-02 20:32:28,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 20:32:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 20:32:28,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 20:32:28,449 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-12-02 20:32:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:28,518 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-12-02 20:32:28,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:32:28,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-12-02 20:32:28,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:28,519 INFO L225 Difference]: With dead ends: 52 [2018-12-02 20:32:28,520 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 20:32:28,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:32:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 20:32:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 20:32:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 20:32:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-12-02 20:32:28,524 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-12-02 20:32:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:28,525 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-12-02 20:32:28,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 20:32:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-12-02 20:32:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-02 20:32:28,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:28,526 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:28,526 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:28,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 995062905, now seen corresponding path program 5 times [2018-12-02 20:32:28,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 195 proven. 269 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2018-12-02 20:32:28,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:28,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:28,602 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 20:32:28,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-12-02 20:32:28,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:28,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 958 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-12-02 20:32:28,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:28,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 20:32:28,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 20:32:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 20:32:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 20:32:28,660 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2018-12-02 20:32:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:28,727 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-12-02 20:32:28,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 20:32:28,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-12-02 20:32:28,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:28,728 INFO L225 Difference]: With dead ends: 88 [2018-12-02 20:32:28,728 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 20:32:28,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-12-02 20:32:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 20:32:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 20:32:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 20:32:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-12-02 20:32:28,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 192 [2018-12-02 20:32:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:28,732 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-12-02 20:32:28,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 20:32:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-12-02 20:32:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 20:32:28,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:28,734 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:28,734 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:28,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:28,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 6 times [2018-12-02 20:32:28,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:28,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:28,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-12-02 20:32:28,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:28,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 20:32:28,808 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-12-02 20:32:28,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:28,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-12-02 20:32:28,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-12-02 20:32:28,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 20:32:28,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 20:32:28,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-02 20:32:28,848 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 9 states. [2018-12-02 20:32:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:28,916 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-12-02 20:32:28,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 20:32:28,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-12-02 20:32:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:28,917 INFO L225 Difference]: With dead ends: 54 [2018-12-02 20:32:28,917 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 20:32:28,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-02 20:32:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 20:32:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-02 20:32:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 20:32:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2018-12-02 20:32:28,923 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 123 [2018-12-02 20:32:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:28,923 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2018-12-02 20:32:28,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 20:32:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2018-12-02 20:32:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-02 20:32:28,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:28,926 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 24, 14, 14, 14, 14, 14, 14, 14, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:28,926 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:28,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2124849606, now seen corresponding path program 7 times [2018-12-02 20:32:28,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:28,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:28,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:28,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 246 proven. 508 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2018-12-02 20:32:29,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:29,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:29,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:29,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2264 backedges. 117 proven. 645 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2018-12-02 20:32:29,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2018-12-02 20:32:29,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 20:32:29,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 20:32:29,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-12-02 20:32:29,188 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 17 states. [2018-12-02 20:32:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:29,522 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2018-12-02 20:32:29,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 20:32:29,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 205 [2018-12-02 20:32:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:29,523 INFO L225 Difference]: With dead ends: 120 [2018-12-02 20:32:29,523 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 20:32:29,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 20:32:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 20:32:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-02 20:32:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-02 20:32:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 99 transitions. [2018-12-02 20:32:29,530 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 99 transitions. Word has length 205 [2018-12-02 20:32:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:29,530 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 99 transitions. [2018-12-02 20:32:29,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 20:32:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 99 transitions. [2018-12-02 20:32:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-02 20:32:29,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:29,533 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:29,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2018-12-02 20:32:29,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:29,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 20:32:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 702 proven. 270 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2018-12-02 20:32:29,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:29,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:29,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 20:32:29,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 20:32:29,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:29,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2018-12-02 20:32:29,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:29,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 11 [2018-12-02 20:32:29,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 20:32:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 20:32:29,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 20:32:29,765 INFO L87 Difference]: Start difference. First operand 76 states and 99 transitions. Second operand 11 states. [2018-12-02 20:32:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:29,853 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2018-12-02 20:32:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 20:32:29,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2018-12-02 20:32:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:29,854 INFO L225 Difference]: With dead ends: 85 [2018-12-02 20:32:29,854 INFO L226 Difference]: Without dead ends: 81 [2018-12-02 20:32:29,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-12-02 20:32:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-02 20:32:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-02 20:32:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-02 20:32:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2018-12-02 20:32:29,861 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 286 [2018-12-02 20:32:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:29,861 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2018-12-02 20:32:29,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 20:32:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2018-12-02 20:32:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2018-12-02 20:32:29,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:29,865 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 77, 47, 47, 47, 47, 47, 47, 47, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:29,865 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:29,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1400798347, now seen corresponding path program 9 times [2018-12-02 20:32:29,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:29,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 1783 proven. 2449 refuted. 0 times theorem prover too weak. 20878 trivial. 0 not checked. [2018-12-02 20:32:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:30,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:30,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 20:32:30,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-02 20:32:30,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:30,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 25110 backedges. 2887 proven. 123 refuted. 0 times theorem prover too weak. 22100 trivial. 0 not checked. [2018-12-02 20:32:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2018-12-02 20:32:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 20:32:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 20:32:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-12-02 20:32:30,354 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand 16 states. [2018-12-02 20:32:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:30,581 INFO L93 Difference]: Finished difference Result 165 states and 269 transitions. [2018-12-02 20:32:30,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 20:32:30,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 654 [2018-12-02 20:32:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:30,582 INFO L225 Difference]: With dead ends: 165 [2018-12-02 20:32:30,582 INFO L226 Difference]: Without dead ends: 92 [2018-12-02 20:32:30,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 658 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-12-02 20:32:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-02 20:32:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2018-12-02 20:32:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 20:32:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-12-02 20:32:30,588 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 654 [2018-12-02 20:32:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:30,589 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-12-02 20:32:30,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 20:32:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-12-02 20:32:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-12-02 20:32:30,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:30,592 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:30,592 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash -801531759, now seen corresponding path program 10 times [2018-12-02 20:32:30,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:30,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:30,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3266 proven. 751 refuted. 0 times theorem prover too weak. 16974 trivial. 0 not checked. [2018-12-02 20:32:30,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:30,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:30,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 20:32:30,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 20:32:30,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:30,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 11137 proven. 1793 refuted. 0 times theorem prover too weak. 8061 trivial. 0 not checked. [2018-12-02 20:32:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:31,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 21 [2018-12-02 20:32:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 20:32:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 20:32:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-12-02 20:32:31,151 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 21 states. [2018-12-02 20:32:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:31,517 INFO L93 Difference]: Finished difference Result 181 states and 299 transitions. [2018-12-02 20:32:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 20:32:31,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 599 [2018-12-02 20:32:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:31,519 INFO L225 Difference]: With dead ends: 181 [2018-12-02 20:32:31,519 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 20:32:31,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 20:32:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 20:32:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-12-02 20:32:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 20:32:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2018-12-02 20:32:31,527 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 599 [2018-12-02 20:32:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:31,528 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2018-12-02 20:32:31,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 20:32:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2018-12-02 20:32:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-12-02 20:32:31,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:31,530 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:31,530 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:31,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 11 times [2018-12-02 20:32:31,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:31,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:31,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 20:32:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1915 proven. 3262 refuted. 0 times theorem prover too weak. 13926 trivial. 0 not checked. [2018-12-02 20:32:31,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 20:32:31,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 20:32:31,808 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 20:32:31,993 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2018-12-02 20:32:31,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 20:32:32,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 20:32:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2649 proven. 2769 refuted. 0 times theorem prover too weak. 13685 trivial. 0 not checked. [2018-12-02 20:32:32,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 20:32:32,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2018-12-02 20:32:32,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 20:32:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 20:32:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-02 20:32:32,174 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand 22 states. [2018-12-02 20:32:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 20:32:32,670 INFO L93 Difference]: Finished difference Result 202 states and 322 transitions. [2018-12-02 20:32:32,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 20:32:32,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 572 [2018-12-02 20:32:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 20:32:32,672 INFO L225 Difference]: With dead ends: 202 [2018-12-02 20:32:32,672 INFO L226 Difference]: Without dead ends: 119 [2018-12-02 20:32:32,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 20:32:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-02 20:32:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-12-02 20:32:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 20:32:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2018-12-02 20:32:32,681 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 572 [2018-12-02 20:32:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 20:32:32,682 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2018-12-02 20:32:32,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 20:32:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2018-12-02 20:32:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-02 20:32:32,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 20:32:32,685 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 20:32:32,685 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 20:32:32,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 20:32:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 12 times [2018-12-02 20:32:32,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 20:32:32,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 20:32:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:32,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 20:32:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 20:32:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:32:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 20:32:32,754 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 20:32:32,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:32:32 BoogieIcfgContainer [2018-12-02 20:32:32,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 20:32:32,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 20:32:32,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 20:32:32,791 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 20:32:32,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:32:27" (3/4) ... [2018-12-02 20:32:32,793 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 20:32:32,844 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f60f889-08df-4ec3-8fca-0d11748c6e1e/bin-2019/uautomizer/witness.graphml [2018-12-02 20:32:32,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 20:32:32,845 INFO L168 Benchmark]: Toolchain (without parser) took 6026.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 518.0 MB). Free memory was 956.0 MB in the beginning and 986.4 MB in the end (delta: -30.4 MB). Peak memory consumption was 487.6 MB. Max. memory is 11.5 GB. [2018-12-02 20:32:32,845 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.09 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: Boogie Preprocessor took 9.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: RCFGBuilder took 153.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: TraceAbstraction took 5668.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 1.1 GB in the beginning and 986.4 MB in the end (delta: 84.9 MB). Peak memory consumption was 516.9 MB. Max. memory is 11.5 GB. [2018-12-02 20:32:32,846 INFO L168 Benchmark]: Witness Printer took 53.44 ms. Allocated memory is still 1.5 GB. Free memory is still 986.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 20:32:32,847 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 126.47 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.09 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.45 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 153.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5668.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 1.1 GB in the beginning and 986.4 MB in the end (delta: 84.9 MB). Peak memory consumption was 516.9 MB. Max. memory is 11.5 GB. * Witness Printer took 53.44 ms. Allocated memory is still 1.5 GB. Free memory is still 986.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 5.6s OverallTime, 15 OverallIterations, 95 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 730 SDslu, 1010 SDs, 0 SdLazy, 1864 SolverSat, 887 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3165 GetRequests, 2914 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6266 NumberOfCodeBlocks, 5487 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 5777 ConstructedInterpolants, 0 QuantifiedInterpolants, 3293611 SizeOfPredicates, 75 NumberOfNonLiveVariables, 4653 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 136362/150880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...