./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_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_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 05:00:39,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:00:39,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:00:39,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:00:39,526 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:00:39,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:00:39,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:00:39,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:00:39,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:00:39,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:00:39,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:00:39,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:00:39,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:00:39,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:00:39,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:00:39,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:00:39,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:00:39,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:00:39,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:00:39,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:00:39,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:00:39,536 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:00:39,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:00:39,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:00:39,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:00:39,538 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:00:39,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:00:39,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:00:39,539 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:00:39,540 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:00:39,540 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:00:39,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:00:39,540 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:00:39,540 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:00:39,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:00:39,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:00:39,541 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 05:00:39,548 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:00:39,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:00:39,549 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:00:39,549 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:00:39,550 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 05:00:39,550 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:00:39,550 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:00:39,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:00:39,551 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:00:39,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:00:39,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:00:39,552 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 05:00:39,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:00:39,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:00:39,552 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_c24080c2-7b10-4868-a5ba-002ccda57598/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2018-12-09 05:00:39,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:00:39,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:00:39,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:00:39,582 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:00:39,583 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:00:39,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 05:00:39,618 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/data/0c2ed3813/4a7da47f51e24a5390b36b8968a7eb33/FLAG099a79d7f [2018-12-09 05:00:40,022 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:00:40,022 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/sv-benchmarks/c/recursive-simple/fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 05:00:40,026 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/data/0c2ed3813/4a7da47f51e24a5390b36b8968a7eb33/FLAG099a79d7f [2018-12-09 05:00:40,034 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/data/0c2ed3813/4a7da47f51e24a5390b36b8968a7eb33 [2018-12-09 05:00:40,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:00:40,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:00:40,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:00:40,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:00:40,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:00:40,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9bdcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40, skipping insertion in model container [2018-12-09 05:00:40,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:00:40,059 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:00:40,148 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:00:40,150 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:00:40,160 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:00:40,167 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:00:40,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40 WrapperNode [2018-12-09 05:00:40,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:00:40,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:00:40,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:00:40,168 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:00:40,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:00:40,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:00:40,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:00:40,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:00:40,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... [2018-12-09 05:00:40,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:00:40,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:00:40,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:00:40,191 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:00:40,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:00:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:00:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:00:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:00:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:00:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:00:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-09 05:00:40,258 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-09 05:00:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-09 05:00:40,259 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-09 05:00:40,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:00:40,363 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 05:00:40,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:00:40 BoogieIcfgContainer [2018-12-09 05:00:40,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:00:40,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:00:40,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:00:40,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:00:40,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:00:40" (1/3) ... [2018-12-09 05:00:40,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f074ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:00:40, skipping insertion in model container [2018-12-09 05:00:40,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:00:40" (2/3) ... [2018-12-09 05:00:40,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f074ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:00:40, skipping insertion in model container [2018-12-09 05:00:40,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:00:40" (3/3) ... [2018-12-09 05:00:40,368 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8_false-unreach-call_true-termination.c [2018-12-09 05:00:40,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:00:40,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:00:40,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:00:40,404 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:00:40,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:00:40,404 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:00:40,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:00:40,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:00:40,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:00:40,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:00:40,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:00:40,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:00:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 05:00:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 05:00:40,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:40,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:40,420 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:40,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2018-12-09 05:00:40,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:40,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:40,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,515 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-09 05:00:40,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:00:40,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:00:40,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:00:40,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:00:40,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:00:40,528 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2018-12-09 05:00:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:40,590 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-12-09 05:00:40,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:00:40,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 05:00:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:40,597 INFO L225 Difference]: With dead ends: 44 [2018-12-09 05:00:40,597 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 05:00:40,599 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-09 05:00:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 05:00:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 05:00:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 05:00:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 05:00:40,624 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2018-12-09 05:00:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:40,624 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 05:00:40,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:00:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 05:00:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 05:00:40,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:40,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:40,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:40,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2018-12-09 05:00:40,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:40,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,649 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-09 05:00:40,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:00:40,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:00:40,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:00:40,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:00:40,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:00:40,651 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-09 05:00:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:40,695 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-12-09 05:00:40,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:00:40,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 05:00:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:40,697 INFO L225 Difference]: With dead ends: 36 [2018-12-09 05:00:40,697 INFO L226 Difference]: Without dead ends: 32 [2018-12-09 05:00:40,697 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-09 05:00:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-09 05:00:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-09 05:00:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 05:00:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-09 05:00:40,703 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2018-12-09 05:00:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:40,703 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-09 05:00:40,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:00:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-09 05:00:40,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 05:00:40,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:40,704 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:40,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:40,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2018-12-09 05:00:40,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:00:40,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:40,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:40,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:40,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:00:40,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:40,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-09 05:00:40,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 05:00:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 05:00:40,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:00:40,837 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2018-12-09 05:00:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:40,941 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2018-12-09 05:00:40,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 05:00:40,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-09 05:00:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:40,942 INFO L225 Difference]: With dead ends: 58 [2018-12-09 05:00:40,942 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 05:00:40,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:00:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 05:00:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-09 05:00:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-09 05:00:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-09 05:00:40,947 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2018-12-09 05:00:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:40,947 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-09 05:00:40,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 05:00:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-09 05:00:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 05:00:40,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:40,948 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:40,948 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:40,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2018-12-09 05:00:40,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:00:40,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:40,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:40,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:40,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:00:41,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:41,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 05:00:41,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:00:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:00:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:00:41,014 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2018-12-09 05:00:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:41,064 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2018-12-09 05:00:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:00:41,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 05:00:41,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:41,065 INFO L225 Difference]: With dead ends: 43 [2018-12-09 05:00:41,065 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 05:00:41,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 05:00:41,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 05:00:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-12-09 05:00:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 05:00:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2018-12-09 05:00:41,070 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2018-12-09 05:00:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:41,070 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2018-12-09 05:00:41,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:00:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-12-09 05:00:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 05:00:41,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:41,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:41,071 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:41,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2018-12-09 05:00:41,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:41,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:41,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:00:41,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:41,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:41,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 05:00:41,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:41,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-09 05:00:41,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:00:41,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:00:41,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:00:41,191 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2018-12-09 05:00:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:41,312 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2018-12-09 05:00:41,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 05:00:41,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-12-09 05:00:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:41,313 INFO L225 Difference]: With dead ends: 70 [2018-12-09 05:00:41,313 INFO L226 Difference]: Without dead ends: 39 [2018-12-09 05:00:41,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:00:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-09 05:00:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-09 05:00:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 05:00:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2018-12-09 05:00:41,319 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2018-12-09 05:00:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:41,319 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2018-12-09 05:00:41,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:00:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2018-12-09 05:00:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 05:00:41,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:41,320 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:41,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:41,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:41,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2018-12-09 05:00:41,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:41,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:41,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 05:00:41,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:41,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:41,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 05:00:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:41,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-09 05:00:41,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:00:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:00:41,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:00:41,414 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 10 states. [2018-12-09 05:00:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:41,507 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2018-12-09 05:00:41,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 05:00:41,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-12-09 05:00:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:41,509 INFO L225 Difference]: With dead ends: 61 [2018-12-09 05:00:41,509 INFO L226 Difference]: Without dead ends: 57 [2018-12-09 05:00:41,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:00:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-09 05:00:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-12-09 05:00:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 05:00:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2018-12-09 05:00:41,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 40 [2018-12-09 05:00:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:41,519 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2018-12-09 05:00:41,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:00:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2018-12-09 05:00:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 05:00:41,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:41,521 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:41,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:41,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2018-12-09 05:00:41,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:41,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 05:00:41,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:41,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 05:00:41,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:41,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2018-12-09 05:00:41,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 05:00:41,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 05:00:41,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:00:41,637 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 10 states. [2018-12-09 05:00:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:41,733 INFO L93 Difference]: Finished difference Result 71 states and 118 transitions. [2018-12-09 05:00:41,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 05:00:41,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-09 05:00:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:41,734 INFO L225 Difference]: With dead ends: 71 [2018-12-09 05:00:41,735 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 05:00:41,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:00:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 05:00:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-09 05:00:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 05:00:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2018-12-09 05:00:41,742 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 54 [2018-12-09 05:00:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:41,742 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2018-12-09 05:00:41,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 05:00:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2018-12-09 05:00:41,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 05:00:41,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:41,745 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:41,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:41,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:41,745 INFO L82 PathProgramCache]: Analyzing trace with hash 671849284, now seen corresponding path program 2 times [2018-12-09 05:00:41,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:41,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:41,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 27 proven. 25 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-09 05:00:41,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:41,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:41,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 05:00:41,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 05:00:41,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:41,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-09 05:00:41,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:41,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-12-09 05:00:41,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 05:00:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 05:00:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:00:41,923 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand 16 states. [2018-12-09 05:00:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:42,239 INFO L93 Difference]: Finished difference Result 146 states and 299 transitions. [2018-12-09 05:00:42,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 05:00:42,240 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-12-09 05:00:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:42,242 INFO L225 Difference]: With dead ends: 146 [2018-12-09 05:00:42,242 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 05:00:42,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-12-09 05:00:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 05:00:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-12-09 05:00:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-09 05:00:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 157 transitions. [2018-12-09 05:00:42,252 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 157 transitions. Word has length 80 [2018-12-09 05:00:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:42,253 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 157 transitions. [2018-12-09 05:00:42,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 05:00:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 157 transitions. [2018-12-09 05:00:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 05:00:42,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:42,255 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:42,255 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:42,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1162514868, now seen corresponding path program 1 times [2018-12-09 05:00:42,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:42,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:42,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 77 proven. 154 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-12-09 05:00:42,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:42,355 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:42,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 40 proven. 230 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-09 05:00:42,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:42,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-12-09 05:00:42,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 05:00:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 05:00:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:00:42,508 INFO L87 Difference]: Start difference. First operand 87 states and 157 transitions. Second operand 18 states. [2018-12-09 05:00:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:42,939 INFO L93 Difference]: Finished difference Result 232 states and 520 transitions. [2018-12-09 05:00:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 05:00:42,939 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 162 [2018-12-09 05:00:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:42,942 INFO L225 Difference]: With dead ends: 232 [2018-12-09 05:00:42,942 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 05:00:42,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 05:00:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 05:00:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2018-12-09 05:00:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 05:00:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2018-12-09 05:00:42,958 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 162 [2018-12-09 05:00:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:42,959 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2018-12-09 05:00:42,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 05:00:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2018-12-09 05:00:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-12-09 05:00:42,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:42,962 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 16, 16, 15, 13, 11, 11, 11, 11, 11, 11, 11, 10, 8, 8, 8, 8, 8, 8, 8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:42,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:42,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 287168718, now seen corresponding path program 2 times [2018-12-09 05:00:42,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 336 proven. 113 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2018-12-09 05:00:43,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:43,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:43,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 05:00:43,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 05:00:43,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:43,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2007 backedges. 91 proven. 518 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2018-12-09 05:00:43,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:43,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2018-12-09 05:00:43,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 05:00:43,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 05:00:43,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:00:43,355 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand 18 states. [2018-12-09 05:00:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:43,673 INFO L93 Difference]: Finished difference Result 277 states and 496 transitions. [2018-12-09 05:00:43,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 05:00:43,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 269 [2018-12-09 05:00:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:43,675 INFO L225 Difference]: With dead ends: 277 [2018-12-09 05:00:43,676 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 05:00:43,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 05:00:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 05:00:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2018-12-09 05:00:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 05:00:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 248 transitions. [2018-12-09 05:00:43,687 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 248 transitions. Word has length 269 [2018-12-09 05:00:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:43,688 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 248 transitions. [2018-12-09 05:00:43,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 05:00:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 248 transitions. [2018-12-09 05:00:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-12-09 05:00:43,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:43,696 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 29, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 13, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:43,696 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:43,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1125647128, now seen corresponding path program 3 times [2018-12-09 05:00:43,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:43,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:43,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6119 backedges. 659 proven. 219 refuted. 0 times theorem prover too weak. 5241 trivial. 0 not checked. [2018-12-09 05:00:43,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:43,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:43,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 05:00:43,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 05:00:43,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:43,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6119 backedges. 755 proven. 7 refuted. 0 times theorem prover too weak. 5357 trivial. 0 not checked. [2018-12-09 05:00:44,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:44,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2018-12-09 05:00:44,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 05:00:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 05:00:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:00:44,004 INFO L87 Difference]: Start difference. First operand 147 states and 248 transitions. Second operand 13 states. [2018-12-09 05:00:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:44,140 INFO L93 Difference]: Finished difference Result 291 states and 544 transitions. [2018-12-09 05:00:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 05:00:44,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 464 [2018-12-09 05:00:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:44,142 INFO L225 Difference]: With dead ends: 291 [2018-12-09 05:00:44,142 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 05:00:44,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:00:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 05:00:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-09 05:00:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-09 05:00:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 234 transitions. [2018-12-09 05:00:44,153 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 234 transitions. Word has length 464 [2018-12-09 05:00:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:44,154 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 234 transitions. [2018-12-09 05:00:44,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 05:00:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 234 transitions. [2018-12-09 05:00:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-12-09 05:00:44,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:44,156 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 26, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 10, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:44,156 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:44,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1745001759, now seen corresponding path program 4 times [2018-12-09 05:00:44,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:44,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5065 backedges. 210 proven. 448 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2018-12-09 05:00:44,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:44,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:44,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 05:00:44,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 05:00:44,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:44,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5065 backedges. 192 proven. 710 refuted. 0 times theorem prover too weak. 4163 trivial. 0 not checked. [2018-12-09 05:00:44,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:44,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 14 [2018-12-09 05:00:44,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 05:00:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 05:00:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:00:44,434 INFO L87 Difference]: Start difference. First operand 142 states and 234 transitions. Second operand 14 states. [2018-12-09 05:00:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:44,646 INFO L93 Difference]: Finished difference Result 326 states and 666 transitions. [2018-12-09 05:00:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 05:00:44,646 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 424 [2018-12-09 05:00:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:44,648 INFO L225 Difference]: With dead ends: 326 [2018-12-09 05:00:44,648 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 05:00:44,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-12-09 05:00:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 05:00:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 169. [2018-12-09 05:00:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 05:00:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 322 transitions. [2018-12-09 05:00:44,658 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 322 transitions. Word has length 424 [2018-12-09 05:00:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:44,658 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 322 transitions. [2018-12-09 05:00:44,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 05:00:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 322 transitions. [2018-12-09 05:00:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-12-09 05:00:44,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:44,661 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 40, 40, 35, 32, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 15, 11, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:44,661 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:44,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2088460972, now seen corresponding path program 5 times [2018-12-09 05:00:44,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:44,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:44,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9423 backedges. 980 proven. 558 refuted. 0 times theorem prover too weak. 7885 trivial. 0 not checked. [2018-12-09 05:00:44,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:44,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 05:00:44,959 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-12-09 05:00:44,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:44,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9423 backedges. 5295 proven. 135 refuted. 0 times theorem prover too weak. 3993 trivial. 0 not checked. [2018-12-09 05:00:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:45,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2018-12-09 05:00:45,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 05:00:45,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 05:00:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-12-09 05:00:45,135 INFO L87 Difference]: Start difference. First operand 169 states and 322 transitions. Second operand 21 states. [2018-12-09 05:00:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:45,500 INFO L93 Difference]: Finished difference Result 402 states and 934 transitions. [2018-12-09 05:00:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 05:00:45,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 572 [2018-12-09 05:00:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:45,502 INFO L225 Difference]: With dead ends: 402 [2018-12-09 05:00:45,502 INFO L226 Difference]: Without dead ends: 242 [2018-12-09 05:00:45,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 05:00:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-09 05:00:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2018-12-09 05:00:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-09 05:00:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 461 transitions. [2018-12-09 05:00:45,515 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 461 transitions. Word has length 572 [2018-12-09 05:00:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:45,515 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 461 transitions. [2018-12-09 05:00:45,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 05:00:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 461 transitions. [2018-12-09 05:00:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-12-09 05:00:45,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:45,517 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 26, 26, 21, 16, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:45,517 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:45,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 717115084, now seen corresponding path program 1 times [2018-12-09 05:00:45,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:45,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:45,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:45,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 228 proven. 451 refuted. 0 times theorem prover too weak. 3537 trivial. 0 not checked. [2018-12-09 05:00:45,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:45,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/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-09 05:00:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:45,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:45,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 234 proven. 718 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2018-12-09 05:00:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 15 [2018-12-09 05:00:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 05:00:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 05:00:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-12-09 05:00:45,775 INFO L87 Difference]: Start difference. First operand 224 states and 461 transitions. Second operand 15 states. [2018-12-09 05:00:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:46,074 INFO L93 Difference]: Finished difference Result 542 states and 1593 transitions. [2018-12-09 05:00:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 05:00:46,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 387 [2018-12-09 05:00:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:46,077 INFO L225 Difference]: With dead ends: 542 [2018-12-09 05:00:46,077 INFO L226 Difference]: Without dead ends: 206 [2018-12-09 05:00:46,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:00:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-09 05:00:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 197. [2018-12-09 05:00:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-09 05:00:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2018-12-09 05:00:46,090 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 387 [2018-12-09 05:00:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:46,091 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2018-12-09 05:00:46,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 05:00:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2018-12-09 05:00:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-12-09 05:00:46,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:46,093 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 26, 26, 24, 24, 16, 16, 16, 16, 16, 16, 16, 13, 13, 13, 13, 13, 13, 13, 11, 9, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:46,093 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:46,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash 608544440, now seen corresponding path program 6 times [2018-12-09 05:00:46,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:46,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4756 backedges. 427 proven. 473 refuted. 0 times theorem prover too weak. 3856 trivial. 0 not checked. [2018-12-09 05:00:46,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:46,258 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:00:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 05:00:46,303 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-12-09 05:00:46,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4756 backedges. 636 proven. 99 refuted. 0 times theorem prover too weak. 4021 trivial. 0 not checked. [2018-12-09 05:00:46,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:46,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-12-09 05:00:46,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 05:00:46,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 05:00:46,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:00:46,431 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand 18 states. [2018-12-09 05:00:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:46,824 INFO L93 Difference]: Finished difference Result 468 states and 859 transitions. [2018-12-09 05:00:46,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 05:00:46,825 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 409 [2018-12-09 05:00:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:46,826 INFO L225 Difference]: With dead ends: 468 [2018-12-09 05:00:46,826 INFO L226 Difference]: Without dead ends: 233 [2018-12-09 05:00:46,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 05:00:46,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-09 05:00:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2018-12-09 05:00:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-09 05:00:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2018-12-09 05:00:46,837 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 409 [2018-12-09 05:00:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:46,837 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2018-12-09 05:00:46,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 05:00:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2018-12-09 05:00:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-12-09 05:00:46,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:46,839 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 36, 35, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 14, 13, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:46,839 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:46,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1848451991, now seen corresponding path program 7 times [2018-12-09 05:00:46,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:46,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:46,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:46,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10845 backedges. 841 proven. 924 refuted. 0 times theorem prover too weak. 9080 trivial. 0 not checked. [2018-12-09 05:00:47,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:47,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:00:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:47,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10845 backedges. 707 proven. 946 refuted. 0 times theorem prover too weak. 9192 trivial. 0 not checked. [2018-12-09 05:00:47,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:47,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2018-12-09 05:00:47,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 05:00:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 05:00:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-12-09 05:00:47,374 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand 24 states. [2018-12-09 05:00:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:47,872 INFO L93 Difference]: Finished difference Result 419 states and 643 transitions. [2018-12-09 05:00:47,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 05:00:47,872 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 612 [2018-12-09 05:00:47,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:47,873 INFO L225 Difference]: With dead ends: 419 [2018-12-09 05:00:47,873 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 05:00:47,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 05:00:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 05:00:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-12-09 05:00:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 05:00:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2018-12-09 05:00:47,880 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 612 [2018-12-09 05:00:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:47,881 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2018-12-09 05:00:47,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 05:00:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2018-12-09 05:00:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-09 05:00:47,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:47,882 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:47,882 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:47,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 8 times [2018-12-09 05:00:47,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:47,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:00:47,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 385 proven. 976 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-09 05:00:48,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:48,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:00:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 05:00:48,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 05:00:48,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:48,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2018-12-09 05:00:48,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 23 [2018-12-09 05:00:48,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 05:00:48,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 05:00:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-12-09 05:00:48,249 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand 23 states. [2018-12-09 05:00:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:48,866 INFO L93 Difference]: Finished difference Result 383 states and 501 transitions. [2018-12-09 05:00:48,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-09 05:00:48,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 422 [2018-12-09 05:00:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:48,868 INFO L225 Difference]: With dead ends: 383 [2018-12-09 05:00:48,868 INFO L226 Difference]: Without dead ends: 208 [2018-12-09 05:00:48,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 05:00:48,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-09 05:00:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 187. [2018-12-09 05:00:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-09 05:00:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 228 transitions. [2018-12-09 05:00:48,880 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 228 transitions. Word has length 422 [2018-12-09 05:00:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:48,881 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 228 transitions. [2018-12-09 05:00:48,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 05:00:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 228 transitions. [2018-12-09 05:00:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-12-09 05:00:48,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:48,884 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 29, 28, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 12, 10, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:48,884 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:48,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 944348834, now seen corresponding path program 9 times [2018-12-09 05:00:48,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:48,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:48,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:48,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:00:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 1065 proven. 290 refuted. 0 times theorem prover too weak. 5485 trivial. 0 not checked. [2018-12-09 05:00:49,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:00:49,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:00:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 05:00:49,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-09 05:00:49,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 05:00:49,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:00:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6840 backedges. 1231 proven. 137 refuted. 0 times theorem prover too weak. 5472 trivial. 0 not checked. [2018-12-09 05:00:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:00:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2018-12-09 05:00:49,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 05:00:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 05:00:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-12-09 05:00:49,294 INFO L87 Difference]: Start difference. First operand 187 states and 228 transitions. Second operand 23 states. [2018-12-09 05:00:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:00:49,865 INFO L93 Difference]: Finished difference Result 320 states and 398 transitions. [2018-12-09 05:00:49,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 05:00:49,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 490 [2018-12-09 05:00:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:00:49,866 INFO L225 Difference]: With dead ends: 320 [2018-12-09 05:00:49,866 INFO L226 Difference]: Without dead ends: 195 [2018-12-09 05:00:49,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 485 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=2100, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 05:00:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-09 05:00:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 177. [2018-12-09 05:00:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-09 05:00:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2018-12-09 05:00:49,874 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 490 [2018-12-09 05:00:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:00:49,874 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2018-12-09 05:00:49,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 05:00:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2018-12-09 05:00:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-12-09 05:00:49,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:00:49,876 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 05:00:49,876 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:00:49,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:00:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 10 times [2018-12-09 05:00:49,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 05:00:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 05:00:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:49,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 05:00:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:00:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:00:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 05:00:49,927 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 05:00:49,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:00:49 BoogieIcfgContainer [2018-12-09 05:00:49,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:00:49,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:00:49,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:00:49,966 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:00:49,966 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:00:40" (3/4) ... [2018-12-09 05:00:49,968 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 05:00:50,023 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c24080c2-7b10-4868-a5ba-002ccda57598/bin-2019/uautomizer/witness.graphml [2018-12-09 05:00:50,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:00:50,024 INFO L168 Benchmark]: Toolchain (without parser) took 9987.73 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 695.7 MB). Free memory was 959.7 MB in the beginning and 815.9 MB in the end (delta: 143.9 MB). Peak memory consumption was 839.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:00:50,024 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:00:50,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:00:50,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.79 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:00:50,025 INFO L168 Benchmark]: Boogie Preprocessor took 10.59 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:00:50,025 INFO L168 Benchmark]: RCFGBuilder took 173.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -105.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:00:50,025 INFO L168 Benchmark]: TraceAbstraction took 9601.17 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 625.5 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 235.8 MB). Peak memory consumption was 861.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:00:50,026 INFO L168 Benchmark]: Witness Printer took 57.36 ms. Allocated memory is still 1.7 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:00:50,027 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 949.0 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.79 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.59 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 173.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -105.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9601.17 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 625.5 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 235.8 MB). Peak memory consumption was 861.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.36 ms. Allocated memory is still 1.7 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 9.5s OverallTime, 19 OverallIterations, 47 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 603 SDtfs, 1121 SDslu, 4218 SDs, 0 SdLazy, 6612 SolverSat, 1216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4870 GetRequests, 4436 SyntacticMatches, 2 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=13, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 184 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 9444 NumberOfCodeBlocks, 8203 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 8947 ConstructedInterpolants, 0 QuantifiedInterpolants, 4633359 SizeOfPredicates, 95 NumberOfNonLiveVariables, 7171 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 34 InterpolantComputations, 2 PerfectInterpolantSequences, 101552/110310 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...