./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_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/Fibonacci04_false-unreach-call_true-no-overflow_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 d3562c726fb0df5872bc6ae08c11ec0d40862c19 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:56:22,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:56:22,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:56:22,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:56:22,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:56:22,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:56:22,277 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:56:22,278 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:56:22,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:56:22,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:56:22,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:56:22,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:56:22,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:56:22,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:56:22,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:56:22,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:56:22,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:56:22,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:56:22,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:56:22,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:56:22,295 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:56:22,296 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:56:22,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:56:22,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:56:22,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:56:22,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:56:22,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:56:22,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:56:22,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:56:22,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:56:22,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:56:22,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:56:22,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:56:22,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:56:22,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:56:22,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:56:22,309 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:56:22,324 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:56:22,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:56:22,326 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:56:22,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:56:22,326 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:56:22,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:56:22,327 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:56:22,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:56:22,327 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:56:22,327 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:56:22,328 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:56:22,329 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:56:22,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:56:22,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:56:22,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:56:22,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:56:22,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:56:22,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:56:22,331 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:56:22,332 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:56:22,332 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:56:22,332 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:56:22,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:56:22,333 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 -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2019-01-12 14:56:22,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:56:22,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:56:22,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:56:22,401 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:56:22,403 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:56:22,404 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:22,461 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bce20fb/bd4295d96f33460183c94893a3e68291/FLAGb16d42f5d [2019-01-12 14:56:22,896 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:56:22,897 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:22,904 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bce20fb/bd4295d96f33460183c94893a3e68291/FLAGb16d42f5d [2019-01-12 14:56:23,278 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bce20fb/bd4295d96f33460183c94893a3e68291 [2019-01-12 14:56:23,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:56:23,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:56:23,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:23,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:56:23,289 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:56:23,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4059bae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23, skipping insertion in model container [2019-01-12 14:56:23,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:56:23,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:56:23,548 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:23,551 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:56:23,567 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:23,579 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:56:23,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23 WrapperNode [2019-01-12 14:56:23,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:23,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:23,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:56:23,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:56:23,590 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:56:23" (1/1) ... [2019-01-12 14:56:23,595 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:56:23" (1/1) ... [2019-01-12 14:56:23,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:23,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:56:23,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:56:23,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:56:23,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (1/1) ... [2019-01-12 14:56:23,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:56:23,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:56:23,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:56:23,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:56:23,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (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:56:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-01-12 14:56:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-01-12 14:56:23,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:56:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:56:23,960 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:56:23,960 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:56:23,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:23 BoogieIcfgContainer [2019-01-12 14:56:23,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:56:23,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:56:23,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:56:23,965 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:56:23,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:56:23" (1/3) ... [2019-01-12 14:56:23,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ce892f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:23, skipping insertion in model container [2019-01-12 14:56:23,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:23" (2/3) ... [2019-01-12 14:56:23,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16ce892f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:23, skipping insertion in model container [2019-01-12 14:56:23,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:23" (3/3) ... [2019-01-12 14:56:23,969 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci04_false-unreach-call_true-no-overflow_true-termination.c [2019-01-12 14:56:23,979 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:56:23,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:56:24,004 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:56:24,036 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:56:24,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:56:24,037 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:56:24,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:56:24,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:56:24,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:56:24,037 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:56:24,038 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:56:24,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:56:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-12 14:56:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:56:24,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:24,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:24,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:24,070 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-01-12 14:56:24,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:24,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:24,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:24,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:24,339 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:56:24,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:24,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:24,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:24,366 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-01-12 14:56:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:24,525 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-01-12 14:56:24,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:24,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:56:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:24,536 INFO L225 Difference]: With dead ends: 30 [2019-01-12 14:56:24,536 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:56:24,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:56:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:56:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:56:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:56:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:56:24,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-01-12 14:56:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:24,577 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:56:24,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:56:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:56:24,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:24,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:24,580 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-01-12 14:56:24,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:24,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:24,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:24,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:24,647 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:56:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:24,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:24,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:24,650 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-01-12 14:56:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:24,945 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-12 14:56:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:24,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:56:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:24,948 INFO L225 Difference]: With dead ends: 23 [2019-01-12 14:56:24,948 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:56:24,949 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:56:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:56:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-12 14:56:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:56:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:56:24,958 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-01-12 14:56:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:24,958 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:56:24,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:56:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:56:24,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:24,960 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:56:24,960 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:24,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:24,961 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-01-12 14:56:24,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:24,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:24,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:25,138 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:56:25,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:25,139 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:56:25,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:25,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:25,283 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:56:25,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:25,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:56:25,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:25,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:25,309 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-01-12 14:56:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:25,642 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-12 14:56:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:56:25,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 14:56:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:25,646 INFO L225 Difference]: With dead ends: 34 [2019-01-12 14:56:25,646 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:56:25,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:56:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 14:56:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 14:56:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-12 14:56:25,661 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-01-12 14:56:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:25,662 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-12 14:56:25,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-01-12 14:56:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:56:25,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:25,665 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:56:25,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-01-12 14:56:25,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:25,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:25,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:25,767 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:56:25,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:25,767 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:56:25,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:25,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:25,815 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:56:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:25,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:56:25,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:56:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:56:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:56:25,836 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-01-12 14:56:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:26,217 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-01-12 14:56:26,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:56:26,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 14:56:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:26,222 INFO L225 Difference]: With dead ends: 28 [2019-01-12 14:56:26,222 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 14:56:26,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 14:56:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 14:56:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 14:56:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-12 14:56:26,231 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2019-01-12 14:56:26,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:26,232 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-12 14:56:26,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:56:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-12 14:56:26,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:56:26,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:26,234 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:56:26,234 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:26,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-01-12 14:56:26,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:26,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:26,334 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:56:26,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:26,334 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:56:26,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:26,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:26,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:26,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:26,453 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:56:26,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:26,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-01-12 14:56:26,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:56:26,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:56:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:56:26,479 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 9 states. [2019-01-12 14:56:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:26,724 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2019-01-12 14:56:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:56:26,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-01-12 14:56:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:26,730 INFO L225 Difference]: With dead ends: 38 [2019-01-12 14:56:26,731 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:56:26,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:56:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:56:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-12 14:56:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:56:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-01-12 14:56:26,752 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2019-01-12 14:56:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:26,752 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-01-12 14:56:26,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:56:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-01-12 14:56:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 14:56:26,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:26,759 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 10, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:26,759 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash 88850548, now seen corresponding path program 3 times [2019-01-12 14:56:26,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:26,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:26,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 148 proven. 55 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-01-12 14:56:27,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:27,056 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:56:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:27,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-12 14:56:27,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:27,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 166 proven. 15 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-01-12 14:56:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2019-01-12 14:56:27,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:56:27,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:56:27,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:56:27,357 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 15 states. [2019-01-12 14:56:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:28,091 INFO L93 Difference]: Finished difference Result 95 states and 215 transitions. [2019-01-12 14:56:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 14:56:28,092 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-01-12 14:56:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:28,098 INFO L225 Difference]: With dead ends: 95 [2019-01-12 14:56:28,098 INFO L226 Difference]: Without dead ends: 45 [2019-01-12 14:56:28,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:56:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-12 14:56:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-12 14:56:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-12 14:56:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-01-12 14:56:28,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 91 [2019-01-12 14:56:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:28,129 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-01-12 14:56:28,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:56:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2019-01-12 14:56:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 14:56:28,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:28,135 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:56:28,135 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:28,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash -181993491, now seen corresponding path program 4 times [2019-01-12 14:56:28,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:28,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 41 proven. 82 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-01-12 14:56:28,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:28,370 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:56:28,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:28,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:28,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:28,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:28,479 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:56:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2019-01-12 14:56:28,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:28,500 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 8 states. [2019-01-12 14:56:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:28,721 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2019-01-12 14:56:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:28,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-01-12 14:56:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:28,724 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:56:28,724 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:56:28,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:56:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 14:56:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 14:56:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2019-01-12 14:56:28,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 78 [2019-01-12 14:56:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:28,740 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2019-01-12 14:56:28,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2019-01-12 14:56:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 14:56:28,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:28,754 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:56:28,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 5 times [2019-01-12 14:56:28,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:28,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:28,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:28,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:56:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:56:28,866 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:56:28,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:56:28 BoogieIcfgContainer [2019-01-12 14:56:28,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:56:28,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:56:28,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:56:28,919 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:56:28,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:23" (3/4) ... [2019-01-12 14:56:28,922 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:56:28,993 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:56:28,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:56:28,994 INFO L168 Benchmark]: Toolchain (without parser) took 5711.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -225.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:28,996 INFO L168 Benchmark]: CDTParser took 0.28 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:56:28,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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:56:28,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.45 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:56:28,997 INFO L168 Benchmark]: Boogie Preprocessor took 14.68 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:56:28,997 INFO L168 Benchmark]: RCFGBuilder took 333.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:28,998 INFO L168 Benchmark]: TraceAbstraction took 4956.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:28,999 INFO L168 Benchmark]: Witness Printer took 73.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:29,002 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.28 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 295.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 31.45 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 14.68 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 333.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4956.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -77.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 73.97 ms. Allocated memory is still 1.2 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: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 8 OverallIterations, 15 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 104 SDslu, 243 SDs, 0 SdLazy, 480 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 624 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 56477 SizeOfPredicates, 19 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 1241/1570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...