./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0bc64117ef8398002009c167867d7baf0a85044 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:17:59,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:17:59,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:17:59,197 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:17:59,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:17:59,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:17:59,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:17:59,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:17:59,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:17:59,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:17:59,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:17:59,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:17:59,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:17:59,204 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:17:59,205 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:17:59,206 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:17:59,206 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:17:59,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:17:59,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:17:59,210 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:17:59,211 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:17:59,212 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:17:59,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:17:59,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:17:59,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:17:59,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:17:59,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:17:59,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:17:59,218 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:17:59,219 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:17:59,219 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:17:59,220 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:17:59,220 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:17:59,220 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:17:59,221 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:17:59,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:17:59,222 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 23:17:59,233 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:17:59,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:17:59,234 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:17:59,234 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:17:59,235 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:17:59,235 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:17:59,235 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 23:17:59,235 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:17:59,235 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:17:59,236 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:17:59,237 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:17:59,237 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:17:59,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:17:59,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:17:59,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:17:59,239 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:17:59,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:17:59,239 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:17:59,239 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:17:59,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:17:59,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 23:17:59,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:17:59,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:17:59,240 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_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0bc64117ef8398002009c167867d7baf0a85044 [2018-10-26 23:17:59,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:17:59,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:17:59,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:17:59,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:17:59,281 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:17:59,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:17:59,330 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/data/326cb443e/961ccd47655a4bc59d9a8e88b7719919/FLAG3ff853fa7 [2018-10-26 23:17:59,663 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:17:59,664 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/sv-benchmarks/c/recursive/Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:17:59,668 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/data/326cb443e/961ccd47655a4bc59d9a8e88b7719919/FLAG3ff853fa7 [2018-10-26 23:17:59,679 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/data/326cb443e/961ccd47655a4bc59d9a8e88b7719919 [2018-10-26 23:17:59,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:17:59,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 23:17:59,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:17:59,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:17:59,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:17:59,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255b6356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59, skipping insertion in model container [2018-10-26 23:17:59,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:17:59,711 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:17:59,826 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:17:59,828 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:17:59,838 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:17:59,849 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:17:59,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59 WrapperNode [2018-10-26 23:17:59,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:17:59,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:17:59,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:17:59,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:17:59,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... [2018-10-26 23:17:59,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:17:59,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:17:59,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:17:59,872 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:17:59,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:17:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:17:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:17:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-26 23:17:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:17:59,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:18:00,246 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:18:00,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:00 BoogieIcfgContainer [2018-10-26 23:18:00,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:18:00,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:18:00,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:18:00,250 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:18:00,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:17:59" (1/3) ... [2018-10-26 23:18:00,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582f21e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:18:00, skipping insertion in model container [2018-10-26 23:18:00,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:17:59" (2/3) ... [2018-10-26 23:18:00,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582f21e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:18:00, skipping insertion in model container [2018-10-26 23:18:00,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:00" (3/3) ... [2018-10-26 23:18:00,253 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05_false-unreach-call_true-no-overflow_true-termination.c [2018-10-26 23:18:00,261 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:18:00,268 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:18:00,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:18:00,313 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 23:18:00,313 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:18:00,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:18:00,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:18:00,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:18:00,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:18:00,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:18:00,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:18:00,314 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:18:00,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-26 23:18:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 23:18:00,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:00,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:00,348 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:00,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2018-10-26 23:18:00,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:00,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:00,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:00,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:18:00,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:00,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:18:00,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:18:00,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:18:00,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:18:00,708 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2018-10-26 23:18:00,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:00,855 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-26 23:18:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:18:00,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-26 23:18:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:00,864 INFO L225 Difference]: With dead ends: 35 [2018-10-26 23:18:00,864 INFO L226 Difference]: Without dead ends: 21 [2018-10-26 23:18:00,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:18:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-26 23:18:00,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-26 23:18:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 23:18:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 23:18:00,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-10-26 23:18:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:00,905 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 23:18:00,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:18:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 23:18:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 23:18:00,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:00,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:00,907 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:00,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2018-10-26 23:18:00,908 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:00,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:00,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:18:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:18:00,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:18:00,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:18:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:18:00,974 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-10-26 23:18:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:01,225 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-26 23:18:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:18:01,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-26 23:18:01,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:01,227 INFO L225 Difference]: With dead ends: 27 [2018-10-26 23:18:01,227 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 23:18:01,228 INFO L605 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-10-26 23:18:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 23:18:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-26 23:18:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-26 23:18:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-26 23:18:01,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-10-26 23:18:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:01,238 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-26 23:18:01,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:18:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-10-26 23:18:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 23:18:01,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:01,240 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:01,240 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:01,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2018-10-26 23:18:01,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:01,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:01,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:18:01,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:01,357 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:18:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:18:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:01,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 23:18:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:01,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-10-26 23:18:01,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:18:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:18:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:18:01,499 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-10-26 23:18:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:01,731 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-10-26 23:18:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:18:01,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-26 23:18:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:01,733 INFO L225 Difference]: With dead ends: 38 [2018-10-26 23:18:01,733 INFO L226 Difference]: Without dead ends: 23 [2018-10-26 23:18:01,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:18:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-26 23:18:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-26 23:18:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-26 23:18:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-26 23:18:01,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-10-26 23:18:01,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:01,743 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-26 23:18:01,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:18:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-10-26 23:18:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 23:18:01,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:01,744 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:01,744 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:01,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2018-10-26 23:18:01,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:01,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:01,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:18:01,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:01,852 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:01,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:18:01,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:01,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-26 23:18:01,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:18:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:18:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:18:01,912 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-10-26 23:18:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:02,244 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-10-26 23:18:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:18:02,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-26 23:18:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:02,246 INFO L225 Difference]: With dead ends: 32 [2018-10-26 23:18:02,246 INFO L226 Difference]: Without dead ends: 28 [2018-10-26 23:18:02,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:18:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-26 23:18:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-26 23:18:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-26 23:18:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-10-26 23:18:02,253 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-10-26 23:18:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:02,254 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-10-26 23:18:02,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:18:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-10-26 23:18:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 23:18:02,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:02,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:02,255 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:02,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2018-10-26 23:18:02,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:02,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:18:02,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:02,320 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 23:18:02,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 23:18:02,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:02,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-26 23:18:02,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:02,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-10-26 23:18:02,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:18:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:18:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:18:02,428 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 9 states. [2018-10-26 23:18:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:02,608 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2018-10-26 23:18:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:18:02,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-10-26 23:18:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:02,610 INFO L225 Difference]: With dead ends: 42 [2018-10-26 23:18:02,610 INFO L226 Difference]: Without dead ends: 36 [2018-10-26 23:18:02,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-10-26 23:18:02,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-26 23:18:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-10-26 23:18:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-26 23:18:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-10-26 23:18:02,618 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-10-26 23:18:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:02,619 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-10-26 23:18:02,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:18:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-10-26 23:18:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 23:18:02,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:02,621 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:02,621 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:02,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2018-10-26 23:18:02,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:02,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:02,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:02,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-10-26 23:18:02,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:02,801 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:02,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:18:02,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-26 23:18:02,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:02,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-10-26 23:18:03,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:03,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-10-26 23:18:03,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:18:03,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:18:03,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:18:03,040 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-10-26 23:18:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:03,479 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-10-26 23:18:03,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:18:03,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-10-26 23:18:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:03,483 INFO L225 Difference]: With dead ends: 76 [2018-10-26 23:18:03,483 INFO L226 Difference]: Without dead ends: 49 [2018-10-26 23:18:03,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:18:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-26 23:18:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-10-26 23:18:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 23:18:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-10-26 23:18:03,498 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-10-26 23:18:03,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:03,498 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-10-26 23:18:03,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:18:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-10-26 23:18:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-26 23:18:03,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:03,500 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:03,500 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:03,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:03,500 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2018-10-26 23:18:03,500 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:03,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:03,589 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-10-26 23:18:03,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:03,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:03,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 23:18:03,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 23:18:03,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:03,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-26 23:18:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-10-26 23:18:03,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:18:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:18:03,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:18:03,689 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-10-26 23:18:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:03,836 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-10-26 23:18:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:18:03,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-10-26 23:18:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:03,838 INFO L225 Difference]: With dead ends: 52 [2018-10-26 23:18:03,838 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 23:18:03,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:18:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 23:18:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-26 23:18:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 23:18:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-10-26 23:18:03,849 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-10-26 23:18:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:03,850 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-10-26 23:18:03,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:18:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-10-26 23:18:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 23:18:03,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:03,853 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:03,853 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:03,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 995062905, now seen corresponding path program 5 times [2018-10-26 23:18:03,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:03,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 195 proven. 269 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2018-10-26 23:18:04,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:04,153 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:04,165 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-26 23:18:04,294 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-26 23:18:04,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:04,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 958 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2018-10-26 23:18:04,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:04,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-26 23:18:04,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:18:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:18:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:18:04,369 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2018-10-26 23:18:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:04,705 INFO L93 Difference]: Finished difference Result 88 states and 156 transitions. [2018-10-26 23:18:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:18:04,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-10-26 23:18:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:04,707 INFO L225 Difference]: With dead ends: 88 [2018-10-26 23:18:04,707 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 23:18:04,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:18:04,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 23:18:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-26 23:18:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 23:18:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2018-10-26 23:18:04,717 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 192 [2018-10-26 23:18:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:04,717 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2018-10-26 23:18:04,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:18:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-10-26 23:18:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 23:18:04,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:04,720 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:04,721 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:04,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1737041458, now seen corresponding path program 6 times [2018-10-26 23:18:04,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:04,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:04,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-10-26 23:18:04,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:04,799 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:04,805 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-26 23:18:04,889 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-10-26 23:18:04,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:04,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 54 proven. 273 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-10-26 23:18:04,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:04,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2018-10-26 23:18:04,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:18:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:18:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:18:04,951 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 9 states. [2018-10-26 23:18:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:05,051 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2018-10-26 23:18:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:18:05,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2018-10-26 23:18:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:05,053 INFO L225 Difference]: With dead ends: 54 [2018-10-26 23:18:05,053 INFO L226 Difference]: Without dead ends: 50 [2018-10-26 23:18:05,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:18:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-26 23:18:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-26 23:18:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 23:18:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2018-10-26 23:18:05,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 123 [2018-10-26 23:18:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:05,062 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2018-10-26 23:18:05,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:18:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2018-10-26 23:18:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:18:05,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:05,067 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:05,067 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:05,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1120272490, now seen corresponding path program 7 times [2018-10-26 23:18:05,067 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:05,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:05,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-10-26 23:18:05,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:05,260 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:05,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:05,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-10-26 23:18:05,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2018-10-26 23:18:05,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 23:18:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 23:18:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:18:05,446 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 18 states. [2018-10-26 23:18:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:06,231 INFO L93 Difference]: Finished difference Result 128 states and 232 transitions. [2018-10-26 23:18:06,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-26 23:18:06,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 204 [2018-10-26 23:18:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:06,233 INFO L225 Difference]: With dead ends: 128 [2018-10-26 23:18:06,233 INFO L226 Difference]: Without dead ends: 84 [2018-10-26 23:18:06,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 23:18:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-26 23:18:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-26 23:18:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-26 23:18:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2018-10-26 23:18:06,243 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 204 [2018-10-26 23:18:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:06,244 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2018-10-26 23:18:06,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 23:18:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2018-10-26 23:18:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-26 23:18:06,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:06,250 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:06,250 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:06,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1795105459, now seen corresponding path program 8 times [2018-10-26 23:18:06,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:06,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:06,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 238 proven. 1112 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2018-10-26 23:18:06,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:06,505 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:06,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 23:18:06,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 23:18:06,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:06,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 204 proven. 1348 refuted. 0 times theorem prover too weak. 4487 trivial. 0 not checked. [2018-10-26 23:18:06,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:06,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-10-26 23:18:06,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 23:18:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 23:18:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:18:06,713 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 11 states. [2018-10-26 23:18:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:06,989 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2018-10-26 23:18:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:18:06,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 327 [2018-10-26 23:18:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:06,992 INFO L225 Difference]: With dead ends: 90 [2018-10-26 23:18:06,992 INFO L226 Difference]: Without dead ends: 86 [2018-10-26 23:18:06,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:18:06,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-26 23:18:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-10-26 23:18:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-26 23:18:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2018-10-26 23:18:07,004 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 327 [2018-10-26 23:18:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:07,005 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2018-10-26 23:18:07,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 23:18:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2018-10-26 23:18:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-26 23:18:07,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:07,016 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 59, 36, 36, 36, 36, 36, 36, 36, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:07,016 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:07,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:07,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1913375586, now seen corresponding path program 9 times [2018-10-26 23:18:07,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:07,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:07,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:07,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:07,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 2481 proven. 690 refuted. 0 times theorem prover too weak. 11572 trivial. 0 not checked. [2018-10-26 23:18:07,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:07,382 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:18:07,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-10-26 23:18:07,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:07,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14743 backedges. 5016 proven. 123 refuted. 0 times theorem prover too weak. 9604 trivial. 0 not checked. [2018-10-26 23:18:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2018-10-26 23:18:07,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 23:18:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 23:18:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:18:07,663 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand 16 states. [2018-10-26 23:18:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:08,031 INFO L93 Difference]: Finished difference Result 171 states and 265 transitions. [2018-10-26 23:18:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 23:18:08,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 504 [2018-10-26 23:18:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:08,033 INFO L225 Difference]: With dead ends: 171 [2018-10-26 23:18:08,033 INFO L226 Difference]: Without dead ends: 93 [2018-10-26 23:18:08,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2018-10-26 23:18:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-26 23:18:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-10-26 23:18:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 23:18:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2018-10-26 23:18:08,045 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 504 [2018-10-26 23:18:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:08,046 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2018-10-26 23:18:08,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 23:18:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2018-10-26 23:18:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-26 23:18:08,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:08,048 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:08,049 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:08,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1942503438, now seen corresponding path program 10 times [2018-10-26 23:18:08,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:08,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:08,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:08,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1240 proven. 3038 refuted. 0 times theorem prover too weak. 12129 trivial. 0 not checked. [2018-10-26 23:18:08,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:08,905 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/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-10-26 23:18:08,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 23:18:08,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 23:18:08,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:18:08,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:18:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8261 proven. 1793 refuted. 0 times theorem prover too weak. 6353 trivial. 0 not checked. [2018-10-26 23:18:09,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:18:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-10-26 23:18:09,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-26 23:18:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-26 23:18:09,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-10-26 23:18:09,207 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand 20 states. [2018-10-26 23:18:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:09,987 INFO L93 Difference]: Finished difference Result 177 states and 283 transitions. [2018-10-26 23:18:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-26 23:18:09,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 531 [2018-10-26 23:18:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:09,989 INFO L225 Difference]: With dead ends: 177 [2018-10-26 23:18:09,989 INFO L226 Difference]: Without dead ends: 102 [2018-10-26 23:18:09,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=446, Invalid=1534, Unknown=0, NotChecked=0, Total=1980 [2018-10-26 23:18:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-26 23:18:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-10-26 23:18:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-26 23:18:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 134 transitions. [2018-10-26 23:18:09,999 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 134 transitions. Word has length 531 [2018-10-26 23:18:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:10,000 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 134 transitions. [2018-10-26 23:18:10,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-26 23:18:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 134 transitions. [2018-10-26 23:18:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-26 23:18:10,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:10,004 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:10,004 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:10,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:10,004 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 11 times [2018-10-26 23:18:10,005 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:18:10,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:18:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:10,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:18:10,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:18:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:18:10,098 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 23:18:10,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:18:10 BoogieIcfgContainer [2018-10-26 23:18:10,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:18:10,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:18:10,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:18:10,148 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:18:10,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:00" (3/4) ... [2018-10-26 23:18:10,151 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:18:10,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32373975-b8a5-4aa0-a725-4941edabd6f4/bin-2019/uautomizer/witness.graphml [2018-10-26 23:18:10,261 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:18:10,262 INFO L168 Benchmark]: Toolchain (without parser) took 10580.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.3 MB). Free memory was 961.8 MB in the beginning and 1.3 GB in the end (delta: -306.4 MB). Peak memory consumption was 165.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:18:10,263 INFO L168 Benchmark]: CDTParser took 2.29 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:18:10,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.43 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:18:10,264 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:18:10,264 INFO L168 Benchmark]: RCFGBuilder took 374.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:18:10,264 INFO L168 Benchmark]: TraceAbstraction took 9899.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -117.0 MB). Peak memory consumption was 180.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:18:10,265 INFO L168 Benchmark]: Witness Printer took 113.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:18:10,267 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.29 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.43 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory is still 951.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 374.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9899.98 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.8 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -117.0 MB). Peak memory consumption was 180.8 MB. Max. memory is 11.5 GB. * Witness Printer took 113.70 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L20] EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L20] EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L20] EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] RET return fibonacci(n-1) + fibonacci(n-2); [L27] EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 14 OverallIterations, 77 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 268 SDtfs, 532 SDslu, 905 SDs, 0 SdLazy, 1518 SolverSat, 603 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2371 GetRequests, 2164 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred 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, 13 MinimizatonAttempts, 28 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 4766 NumberOfCodeBlocks, 4255 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 4279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1938401 SizeOfPredicates, 61 NumberOfNonLiveVariables, 3590 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 75971/85668 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...