./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_2calls_4_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 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 09:52:54,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:52:54,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:52:54,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:52:54,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:52:54,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:52:54,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:52:54,487 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:52:54,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:52:54,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:52:54,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:52:54,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:52:54,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:52:54,493 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:52:54,494 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:52:54,495 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:52:54,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:52:54,498 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:52:54,500 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:52:54,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:52:54,503 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:52:54,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:52:54,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:52:54,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:52:54,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:52:54,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:52:54,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:52:54,511 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:52:54,512 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:52:54,513 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:52:54,513 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:52:54,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:52:54,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:52:54,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:52:54,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:52:54,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:52:54,517 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:52:54,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:52:54,537 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:52:54,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:52:54,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:52:54,539 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:52:54,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:52:54,539 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:52:54,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:52:54,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:52:54,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:52:54,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:52:54,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:52:54,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:52:54,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:52:54,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:52:54,544 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:52:54,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:52:54,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:52:54,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:52:54,544 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:52:54,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:52:54,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:52:54,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:52:54,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:52:54,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:52:54,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:52:54,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:52:54,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:52:54,548 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 -> 7a7b79fb8a331a00295fb9ddfb653e17bda3c30d [2018-12-31 09:52:54,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:52:54,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:52:54,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:52:54,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:52:54,634 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:52:54,635 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c [2018-12-31 09:52:54,708 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8da24ad/36f037b27bd94a57b1fb09cb7679e343/FLAG21c958f7f [2018-12-31 09:52:55,203 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:52:55,204 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_2calls_4_false-unreach-call_true-termination.c [2018-12-31 09:52:55,210 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8da24ad/36f037b27bd94a57b1fb09cb7679e343/FLAG21c958f7f [2018-12-31 09:52:55,541 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc8da24ad/36f037b27bd94a57b1fb09cb7679e343 [2018-12-31 09:52:55,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:52:55,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:52:55,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:52:55,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:52:55,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:52:55,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4d4ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55, skipping insertion in model container [2018-12-31 09:52:55,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:52:55,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:52:55,784 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:52:55,791 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:52:55,818 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:52:55,838 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:52:55,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55 WrapperNode [2018-12-31 09:52:55,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:52:55,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:52:55,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:52:55,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:52:55,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:52:55,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:52:55,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:52:55,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:52:55,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (1/1) ... [2018-12-31 09:52:55,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:52:55,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:52:55,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:52:55,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:52:55,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (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 [2018-12-31 09:52:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:52:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:52:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2018-12-31 09:52:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2018-12-31 09:52:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2018-12-31 09:52:56,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2018-12-31 09:52:56,386 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:52:56,386 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-31 09:52:56,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:56 BoogieIcfgContainer [2018-12-31 09:52:56,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:52:56,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:52:56,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:52:56,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:52:56,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:52:55" (1/3) ... [2018-12-31 09:52:56,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9d814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:52:56, skipping insertion in model container [2018-12-31 09:52:56,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:52:55" (2/3) ... [2018-12-31 09:52:56,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9d814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:52:56, skipping insertion in model container [2018-12-31 09:52:56,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:56" (3/3) ... [2018-12-31 09:52:56,399 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4_false-unreach-call_true-termination.c [2018-12-31 09:52:56,409 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:52:56,418 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 09:52:56,436 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 09:52:56,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:52:56,478 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:52:56,478 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:52:56,478 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:52:56,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:52:56,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:52:56,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:52:56,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:52:56,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:52:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 09:52:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 09:52:56,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:56,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:56,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2018-12-31 09:52:56,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:56,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:56,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:52:56,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:56,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:52:56,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:52:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:52:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:52:56,765 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-12-31 09:52:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:56,949 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-12-31 09:52:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:52:56,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-31 09:52:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:56,963 INFO L225 Difference]: With dead ends: 38 [2018-12-31 09:52:56,963 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 09:52:56,967 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 [2018-12-31 09:52:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 09:52:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 09:52:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:52:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:52:57,012 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2018-12-31 09:52:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:57,013 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:52:57,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:52:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:52:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 09:52:57,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:57,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:57,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2018-12-31 09:52:57,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:57,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:52:57,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:52:57,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:52:57,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:52:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:52:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:52:57,111 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 09:52:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:57,422 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2018-12-31 09:52:57,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:52:57,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 09:52:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:57,424 INFO L225 Difference]: With dead ends: 32 [2018-12-31 09:52:57,424 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 09:52:57,425 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 [2018-12-31 09:52:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 09:52:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 09:52:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 09:52:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 09:52:57,433 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2018-12-31 09:52:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:57,434 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 09:52:57,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:52:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 09:52:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 09:52:57,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:57,435 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:57,436 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2018-12-31 09:52:57,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:57,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:57,596 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 [2018-12-31 09:52:57,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:57,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:57,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:57,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2018-12-31 09:52:57,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:52:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:52:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:57,808 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 9 states. [2018-12-31 09:52:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:58,524 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2018-12-31 09:52:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:52:58,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-31 09:52:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:58,528 INFO L225 Difference]: With dead ends: 54 [2018-12-31 09:52:58,528 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 09:52:58,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-31 09:52:58,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 09:52:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-31 09:52:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 09:52:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 09:52:58,543 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2018-12-31 09:52:58,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:58,543 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 09:52:58,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:52:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 09:52:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 09:52:58,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:58,546 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:58,547 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2018-12-31 09:52:58,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:58,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:58,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:58,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:58,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:58,787 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 [2018-12-31 09:52:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:58,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 09:52:58,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:58,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-31 09:52:58,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 09:52:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 09:52:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:52:58,867 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 09:52:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:59,115 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2018-12-31 09:52:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:52:59,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-31 09:52:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:59,119 INFO L225 Difference]: With dead ends: 39 [2018-12-31 09:52:59,120 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:52:59,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:52:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:52:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-12-31 09:52:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 09:52:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-31 09:52:59,130 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2018-12-31 09:52:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:59,131 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-31 09:52:59,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 09:52:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-31 09:52:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:52:59,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:59,133 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:59,133 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:59,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2018-12-31 09:52:59,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:59,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:59,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:59,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:52:59,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:59,253 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 [2018-12-31 09:52:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:59,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:52:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-31 09:52:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:52:59,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2018-12-31 09:52:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:52:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:52:59,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:52:59,462 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 10 states. [2018-12-31 09:52:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:52:59,814 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2018-12-31 09:52:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 09:52:59,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-12-31 09:52:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:52:59,819 INFO L225 Difference]: With dead ends: 66 [2018-12-31 09:52:59,819 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 09:52:59,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:52:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 09:52:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-31 09:52:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-31 09:52:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2018-12-31 09:52:59,832 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 35 [2018-12-31 09:52:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:52:59,833 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2018-12-31 09:52:59,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:52:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2018-12-31 09:52:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:52:59,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:52:59,837 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:52:59,838 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:52:59,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:52:59,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2018-12-31 09:52:59,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:52:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:52:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:59,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:52:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:52:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:52:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-31 09:52:59,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:52:59,960 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 [2018-12-31 09:52:59,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:00,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 09:53:00,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:00,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-12-31 09:53:00,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:53:00,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:53:00,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:53:00,118 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 10 states. [2018-12-31 09:53:00,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:00,461 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-12-31 09:53:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 09:53:00,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-12-31 09:53:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:00,465 INFO L225 Difference]: With dead ends: 57 [2018-12-31 09:53:00,465 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 09:53:00,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-31 09:53:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 09:53:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-12-31 09:53:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 09:53:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2018-12-31 09:53:00,479 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 36 [2018-12-31 09:53:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:00,479 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2018-12-31 09:53:00,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:53:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2018-12-31 09:53:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-31 09:53:00,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:00,482 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:00,482 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2018-12-31 09:53:00,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:00,591 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-31 09:53:00,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:53:00,591 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 [2018-12-31 09:53:00,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:53:00,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:53:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 09:53:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:53:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2018-12-31 09:53:00,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:53:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:53:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:53:00,718 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand 9 states. [2018-12-31 09:53:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:53:00,897 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2018-12-31 09:53:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:53:00,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-12-31 09:53:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:53:00,901 INFO L225 Difference]: With dead ends: 62 [2018-12-31 09:53:00,901 INFO L226 Difference]: Without dead ends: 58 [2018-12-31 09:53:00,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-31 09:53:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-31 09:53:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2018-12-31 09:53:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 09:53:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-12-31 09:53:00,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 50 [2018-12-31 09:53:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:53:00,917 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-12-31 09:53:00,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:53:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-12-31 09:53:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-31 09:53:00,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:53:00,922 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:53:00,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:53:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:53:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash -26046796, now seen corresponding path program 1 times [2018-12-31 09:53:00,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:53:00,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:53:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:00,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:53:00,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:53:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:53:00,990 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:53:01,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:53:01 BoogieIcfgContainer [2018-12-31 09:53:01,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:53:01,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:53:01,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:53:01,030 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:53:01,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:52:56" (3/4) ... [2018-12-31 09:53:01,034 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:53:01,110 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:53:01,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:53:01,115 INFO L168 Benchmark]: Toolchain (without parser) took 5568.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 954.0 MB in the beginning and 837.2 MB in the end (delta: 116.9 MB). Peak memory consumption was 247.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:01,117 INFO L168 Benchmark]: CDTParser took 0.19 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. [2018-12-31 09:53:01,117 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:01,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:01,119 INFO L168 Benchmark]: Boogie Preprocessor took 18.36 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:53:01,119 INFO L168 Benchmark]: RCFGBuilder took 483.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:01,119 INFO L168 Benchmark]: TraceAbstraction took 4640.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.0 MB in the end (delta: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:01,120 INFO L168 Benchmark]: Witness Printer took 83.91 ms. Allocated memory is still 1.2 GB. Free memory was 844.0 MB in the beginning and 837.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:53:01,124 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.38 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.36 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 483.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4640.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 844.0 MB in the end (delta: 261.1 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. * Witness Printer took 83.91 ms. Allocated memory is still 1.2 GB. Free memory was 844.0 MB in the beginning and 837.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 4; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 3 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 133 SDslu, 497 SDs, 0 SdLazy, 568 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 20815 SizeOfPredicates, 18 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 116/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...