./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-0ed9222-m [2019-01-12 14:58:14,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:58:14,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:58:14,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:58:14,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:58:14,693 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:58:14,694 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:58:14,696 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:58:14,698 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:58:14,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:58:14,699 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:58:14,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:58:14,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:58:14,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:58:14,703 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:58:14,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:58:14,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:58:14,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:58:14,708 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:58:14,710 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:58:14,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:58:14,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:58:14,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:58:14,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:58:14,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:58:14,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:58:14,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:58:14,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:58:14,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:58:14,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:58:14,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:58:14,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:58:14,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:58:14,724 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:58:14,725 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:58:14,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:58:14,726 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:58:14,751 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:58:14,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:58:14,754 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:58:14,755 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:58:14,756 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:58:14,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:58:14,756 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:58:14,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:58:14,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:58:14,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:58:14,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:58:14,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:58:14,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:58:14,759 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:58:14,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:58:14,760 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:58:14,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:58:14,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:58:14,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:58:14,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:58:14,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:58:14,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:58:14,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:58:14,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:58:14,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:58:14,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:58:14,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:58:14,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:58:14,764 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9fa59d7f4411ba9a1b89a97ebb9693c6867ac636 [2019-01-12 14:58:14,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:58:14,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:58:14,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:58:14,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:58:14,823 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:58:14,824 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-12 14:58:14,890 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed011331/4e71128fba764b5caccec1b27c9e0f8b/FLAG0b7cd64ac [2019-01-12 14:58:15,286 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:58:15,286 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_5_false-unreach-call_true-termination.c [2019-01-12 14:58:15,291 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed011331/4e71128fba764b5caccec1b27c9e0f8b/FLAG0b7cd64ac [2019-01-12 14:58:15,689 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed011331/4e71128fba764b5caccec1b27c9e0f8b [2019-01-12 14:58:15,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:58:15,694 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:58:15,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:15,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:58:15,699 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:58:15,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:15,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a8a45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15, skipping insertion in model container [2019-01-12 14:58:15,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:15,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:58:15,730 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:58:15,936 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:15,943 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:58:15,962 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:58:15,979 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:58:15,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15 WrapperNode [2019-01-12 14:58:15,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:58:15,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:15,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:58:15,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:58:15,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:15,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:58:16,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:58:16,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:58:16,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:58:16,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... [2019-01-12 14:58:16,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:58:16,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:58:16,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:58:16,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:58:16,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:58:16,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:58:16,151 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-12 14:58:16,151 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-12 14:58:16,356 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:58:16,357 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:58:16,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:16 BoogieIcfgContainer [2019-01-12 14:58:16,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:58:16,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:58:16,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:58:16,364 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:58:16,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:58:15" (1/3) ... [2019-01-12 14:58:16,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bffa21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:16, skipping insertion in model container [2019-01-12 14:58:16,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:58:15" (2/3) ... [2019-01-12 14:58:16,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bffa21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:58:16, skipping insertion in model container [2019-01-12 14:58:16,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:16" (3/3) ... [2019-01-12 14:58:16,371 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_5_false-unreach-call_true-termination.c [2019-01-12 14:58:16,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:58:16,400 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:58:16,427 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:58:16,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:58:16,480 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:58:16,480 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:58:16,480 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:58:16,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:58:16,481 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:58:16,481 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:58:16,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:58:16,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:58:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 14:58:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:58:16,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:16,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:16,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-01-12 14:58:16,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:16,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:16,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:16,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:58:16,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:58:16,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:58:16,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:58:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:58:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:58:16,705 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 14:58:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:16,868 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-12 14:58:16,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:58:16,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:58:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:16,880 INFO L225 Difference]: With dead ends: 29 [2019-01-12 14:58:16,880 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:58:16,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:58:16,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:58:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:58:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:58:16,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-01-12 14:58:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:16,928 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:58:16,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:58:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:58:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:58:16,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:16,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:16,931 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-01-12 14:58:16,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:16,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:16,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:58:17,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:58:17,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:58:17,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:58:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:58:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:58:17,004 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-01-12 14:58:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:17,272 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-12 14:58:17,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:58:17,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:58:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:17,277 INFO L225 Difference]: With dead ends: 23 [2019-01-12 14:58:17,277 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:58:17,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:58:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-12 14:58:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:58:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:58:17,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-01-12 14:58:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:17,297 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:58:17,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:58:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:58:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:58:17,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:17,301 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:17,301 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-01-12 14:58:17,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:17,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:17,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 14:58:17,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:17,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:58:17,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 14:58:17,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:17,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:58:17,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:58:17,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:58:17,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:17,800 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-01-12 14:58:18,033 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-12 14:58:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:18,201 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-12 14:58:18,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:18,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 14:58:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:18,203 INFO L225 Difference]: With dead ends: 34 [2019-01-12 14:58:18,203 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:58:18,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:58:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 14:58:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 14:58:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-12 14:58:18,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-01-12 14:58:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:18,212 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-12 14:58:18,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:58:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-01-12 14:58:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:58:18,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:18,214 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:18,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:18,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:18,215 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-01-12 14:58:18,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:18,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:18,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:58:18,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:18,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:18,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:58:18,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:18,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:58:18,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:58:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:58:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:58:18,405 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-01-12 14:58:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:18,772 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-01-12 14:58:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:58:18,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 14:58:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:18,776 INFO L225 Difference]: With dead ends: 28 [2019-01-12 14:58:18,776 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 14:58:18,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 14:58:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 14:58:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 14:58:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-12 14:58:18,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2019-01-12 14:58:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:18,794 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-12 14:58:18,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:58:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-12 14:58:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:58:18,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:18,796 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:18,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2019-01-12 14:58:18,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:18,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 14:58:18,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:18,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:58:18,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:58:18,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:18,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 14:58:19,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:19,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-12 14:58:19,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:58:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:58:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:58:19,029 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2019-01-12 14:58:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:19,236 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2019-01-12 14:58:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:19,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 14:58:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:19,239 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:58:19,239 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:58:19,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:58:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-12 14:58:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:58:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-01-12 14:58:19,250 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2019-01-12 14:58:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:19,251 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-01-12 14:58:19,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:58:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-01-12 14:58:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 14:58:19,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:19,255 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:19,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:19,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2019-01-12 14:58:19,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:19,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:19,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-01-12 14:58:19,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:19,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:19,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:58:19,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 14:58:19,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:19,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 130 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 14:58:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-12 14:58:19,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 14:58:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 14:58:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:58:19,800 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2019-01-12 14:58:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:20,134 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2019-01-12 14:58:20,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:20,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-01-12 14:58:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:20,138 INFO L225 Difference]: With dead ends: 61 [2019-01-12 14:58:20,138 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 14:58:20,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:58:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 14:58:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-12 14:58:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 14:58:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-01-12 14:58:20,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2019-01-12 14:58:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:20,154 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-01-12 14:58:20,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 14:58:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-01-12 14:58:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 14:58:20,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:20,157 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:20,158 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-01-12 14:58:20,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:20,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-01-12 14:58:20,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:20,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:58:20,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:58:20,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:20,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-12 14:58:20,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:20,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-01-12 14:58:20,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 14:58:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 14:58:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:58:20,637 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 19 states. [2019-01-12 14:58:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:21,562 INFO L93 Difference]: Finished difference Result 68 states and 148 transitions. [2019-01-12 14:58:21,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 14:58:21,563 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-01-12 14:58:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:21,566 INFO L225 Difference]: With dead ends: 68 [2019-01-12 14:58:21,567 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 14:58:21,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 14:58:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 14:58:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-01-12 14:58:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:58:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2019-01-12 14:58:21,586 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 78 [2019-01-12 14:58:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:21,587 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2019-01-12 14:58:21,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 14:58:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2019-01-12 14:58:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-12 14:58:21,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:21,591 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:21,591 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:21,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash -481968661, now seen corresponding path program 5 times [2019-01-12 14:58:21,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:21,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:21,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:21,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:21,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 254 proven. 314 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-01-12 14:58:21,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:21,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:21,932 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:58:22,057 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 14:58:22,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:22,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1139 proven. 17 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-01-12 14:58:22,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:22,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-01-12 14:58:22,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:58:22,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:58:22,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:22,267 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 12 states. [2019-01-12 14:58:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:22,640 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2019-01-12 14:58:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:58:22,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-01-12 14:58:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:22,644 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:58:22,644 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:58:22,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:58:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:58:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-01-12 14:58:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:58:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2019-01-12 14:58:22,669 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 188 [2019-01-12 14:58:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:22,669 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2019-01-12 14:58:22,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:58:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2019-01-12 14:58:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-12 14:58:22,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:22,678 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 27, 15, 15, 15, 15, 15, 15, 15, 12, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:22,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:22,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash 938563531, now seen corresponding path program 6 times [2019-01-12 14:58:22,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:22,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:22,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:22,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 217 proven. 331 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2019-01-12 14:58:22,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:22,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:22,855 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:58:23,012 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-12 14:58:23,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:58:23,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 1174 proven. 4 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2019-01-12 14:58:23,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:23,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:58:23,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:58:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:58:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:58:23,099 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 7 states. [2019-01-12 14:58:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:23,290 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2019-01-12 14:58:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:58:23,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2019-01-12 14:58:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:23,293 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:58:23,293 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:58:23,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:58:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:58:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:58:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2019-01-12 14:58:23,303 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 216 [2019-01-12 14:58:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:23,304 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2019-01-12 14:58:23,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:58:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2019-01-12 14:58:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 14:58:23,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:23,308 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:23,308 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 7 times [2019-01-12 14:58:23,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:23,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:23,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:58:23,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 241 proven. 102 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-01-12 14:58:23,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:58:23,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 14:58:23,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:58:23,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:58:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 243 proven. 97 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-01-12 14:58:23,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:58:23,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-01-12 14:58:23,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:58:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:58:23,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:58:23,737 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 12 states. [2019-01-12 14:58:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:58:24,078 INFO L93 Difference]: Finished difference Result 61 states and 104 transitions. [2019-01-12 14:58:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:58:24,079 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2019-01-12 14:58:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:58:24,080 INFO L225 Difference]: With dead ends: 61 [2019-01-12 14:58:24,080 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 14:58:24,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:58:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 14:58:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 14:58:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:58:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-01-12 14:58:24,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 132 [2019-01-12 14:58:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:58:24,089 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-01-12 14:58:24,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:58:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-01-12 14:58:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 14:58:24,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:58:24,091 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 14:58:24,092 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:58:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:58:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash 548614988, now seen corresponding path program 8 times [2019-01-12 14:58:24,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:58:24,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:58:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:24,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:58:24,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:58:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:58:24,140 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:58:24,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:58:24 BoogieIcfgContainer [2019-01-12 14:58:24,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:58:24,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:58:24,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:58:24,179 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:58:24,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:58:16" (3/4) ... [2019-01-12 14:58:24,184 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:58:24,279 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:58:24,282 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:58:24,283 INFO L168 Benchmark]: Toolchain (without parser) took 8590.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.6 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -255.0 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:24,285 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:24,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:24,285 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:24,286 INFO L168 Benchmark]: Boogie Preprocessor took 17.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:24,286 INFO L168 Benchmark]: RCFGBuilder took 330.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:24,287 INFO L168 Benchmark]: TraceAbstraction took 7818.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.4 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:58:24,289 INFO L168 Benchmark]: Witness Printer took 103.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:58:24,299 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.59 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7818.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 153.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.4 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * Witness Printer took 103.34 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 5; [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 5 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. UNSAFE Result, 7.7s OverallTime, 11 OverallIterations, 31 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 206 SDslu, 345 SDs, 0 SdLazy, 727 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 789 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=8, 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, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1545 ConstructedInterpolants, 0 QuantifiedInterpolants, 295521 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1135 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 11247/12378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...