./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:25:41,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:25:41,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:25:41,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:25:41,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:25:41,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:25:41,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:25:41,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:25:41,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:25:41,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:25:41,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:25:41,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:25:41,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:25:41,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:25:41,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:25:41,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:25:41,448 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:25:41,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:25:41,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:25:41,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:25:41,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:25:41,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:25:41,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:25:41,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:25:41,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:25:41,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:25:41,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:25:41,455 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:25:41,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:25:41,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:25:41,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:25:41,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:25:41,457 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:25:41,457 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:25:41,458 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:25:41,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:25:41,458 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:25:41,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:25:41,466 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:25:41,466 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:25:41,466 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:25:41,467 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:25:41,467 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:25:41,468 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:25:41,468 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:25:41,468 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:25:41,468 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:25:41,468 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:25:41,468 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:25:41,469 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:25:41,469 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:25:41,470 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:25:41,470 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:25:41,471 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan 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 -> Taipan 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 -> 6e1fd2ba6533b7d8cc379ec5987b906d551e69a3 [2018-12-09 19:25:41,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:25:41,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:25:41,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:25:41,497 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:25:41,498 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:25:41,498 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:25:41,532 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/data/6acc6ad29/635f46507bd84d15ae6c10f29c81abdd/FLAG18f98bc7e [2018-12-09 19:25:41,911 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:25:41,911 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:25:41,915 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/data/6acc6ad29/635f46507bd84d15ae6c10f29c81abdd/FLAG18f98bc7e [2018-12-09 19:25:42,296 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/data/6acc6ad29/635f46507bd84d15ae6c10f29c81abdd [2018-12-09 19:25:42,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:25:42,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:25:42,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:42,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:25:42,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:25:42,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e116857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42, skipping insertion in model container [2018-12-09 19:25:42,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:25:42,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:25:42,411 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:42,414 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:25:42,422 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:25:42,430 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:25:42,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42 WrapperNode [2018-12-09 19:25:42,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:25:42,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:42,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:25:42,431 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:25:42,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:25:42,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:25:42,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:25:42,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:25:42,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... [2018-12-09 19:25:42,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:25:42,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:25:42,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:25:42,452 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:25:42,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:25:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-12-09 19:25:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-12-09 19:25:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:25:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:25:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:25:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:25:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:25:42,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:25:42,594 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:25:42,594 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 19:25:42,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:42 BoogieIcfgContainer [2018-12-09 19:25:42,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:25:42,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:25:42,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:25:42,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:25:42,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:25:42" (1/3) ... [2018-12-09 19:25:42,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31639f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:42, skipping insertion in model container [2018-12-09 19:25:42,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:25:42" (2/3) ... [2018-12-09 19:25:42,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31639f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:25:42, skipping insertion in model container [2018-12-09 19:25:42,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:42" (3/3) ... [2018-12-09 19:25:42,599 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-12-09 19:25:42,606 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:25:42,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:25:42,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:25:42,639 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:25:42,639 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:25:42,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:25:42,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:25:42,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:25:42,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:25:42,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:25:42,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:25:42,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-09 19:25:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 19:25:42,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:42,655 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2018-12-09 19:25:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:42,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:42,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:42,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:42,765 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-09 19:25:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:42,824 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-09 19:25:42,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:42,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 19:25:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:42,832 INFO L225 Difference]: With dead ends: 36 [2018-12-09 19:25:42,832 INFO L226 Difference]: Without dead ends: 22 [2018-12-09 19:25:42,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-09 19:25:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 19:25:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 19:25:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-12-09 19:25:42,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-12-09 19:25:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:42,857 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-09 19:25:42,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:42,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-12-09 19:25:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 19:25:42,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:42,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,859 INFO L82 PathProgramCache]: Analyzing trace with hash -509871596, now seen corresponding path program 1 times [2018-12-09 19:25:42,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:42,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:25:42,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:25:42,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:25:42,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:25:42,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:25:42,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:25:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:25:42,895 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2018-12-09 19:25:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:42,936 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-12-09 19:25:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:25:42,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-09 19:25:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:42,937 INFO L225 Difference]: With dead ends: 28 [2018-12-09 19:25:42,937 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 19:25:42,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:25:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 19:25:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-09 19:25:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 19:25:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-12-09 19:25:42,941 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2018-12-09 19:25:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-09 19:25:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:25:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-12-09 19:25:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 19:25:42,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:42,942 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:42,942 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:42,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2018-12-09 19:25:42,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:42,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:42,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:25:42,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:42,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:42,989 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 19:25:42,990 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2018-12-09 19:25:43,009 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:43,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:43,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:25:43,180 INFO L272 AbstractInterpreter]: Visited 22 different actions 283 times. Never merged. Never widened. Performed 590 root evaluator evaluations with a maximum evaluation depth of 4. Performed 590 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 32 fixpoints after 3 different actions. Largest state had 5 variables. [2018-12-09 19:25:43,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:43,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:25:43,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:43,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:43,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:43,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:43,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 19:25:43,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:43,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:43,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-12-09 19:25:43,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:25:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:25:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:43,361 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2018-12-09 19:25:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:43,428 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-12-09 19:25:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:43,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-09 19:25:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:43,429 INFO L225 Difference]: With dead ends: 39 [2018-12-09 19:25:43,430 INFO L226 Difference]: Without dead ends: 24 [2018-12-09 19:25:43,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:25:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-09 19:25:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-09 19:25:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 19:25:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-09 19:25:43,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2018-12-09 19:25:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:43,434 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-09 19:25:43,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:25:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-09 19:25:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:25:43,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:43,435 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:43,435 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:43,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2018-12-09 19:25:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:43,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:25:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:43,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:43,463 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 19:25:43,463 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2018-12-09 19:25:43,464 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:25:43,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:25:44,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:25:44,211 INFO L272 AbstractInterpreter]: Visited 23 different actions 4122 times. Merged at 10 different actions 1354 times. Never widened. Performed 10130 root evaluator evaluations with a maximum evaluation depth of 4. Performed 10130 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 592 fixpoints after 6 different actions. Largest state had 5 variables. [2018-12-09 19:25:44,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:25:44,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 19:25:44,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:25:44,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:44,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-09 19:25:44,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:44,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:44,330 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-12-09 19:25:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,367 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-12-09 19:25:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:44,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 19:25:44,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,369 INFO L225 Difference]: With dead ends: 33 [2018-12-09 19:25:44,369 INFO L226 Difference]: Without dead ends: 29 [2018-12-09 19:25:44,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-09 19:25:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-09 19:25:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 19:25:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-12-09 19:25:44,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2018-12-09 19:25:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,375 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-09 19:25:44,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-12-09 19:25:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 19:25:44,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,376 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:44,377 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2018-12-09 19:25:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 19:25:44,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:44,411 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:44,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:44,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:44,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:25:44,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:25:44,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 19:25:44,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 19:25:44,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 19:25:44,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:44,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-12-09 19:25:44,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:44,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:25:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:25:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:25:44,561 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 6 states. [2018-12-09 19:25:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,593 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-12-09 19:25:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:25:44,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-09 19:25:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,594 INFO L225 Difference]: With dead ends: 39 [2018-12-09 19:25:44,594 INFO L226 Difference]: Without dead ends: 35 [2018-12-09 19:25:44,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-09 19:25:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-12-09 19:25:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 19:25:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-12-09 19:25:44,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 41 [2018-12-09 19:25:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,598 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-09 19:25:44,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:25:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-12-09 19:25:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 19:25:44,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,599 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:44,599 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2018-12-09 19:25:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 19:25:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:44,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:44,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:44,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 19:25:44,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 19:25:44,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 19:25:44,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:44,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 19:25:44,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 19:25:44,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-12-09 19:25:44,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:44,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:25:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:25:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:25:44,845 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2018-12-09 19:25:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:44,889 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2018-12-09 19:25:44,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:25:44,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-12-09 19:25:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:44,890 INFO L225 Difference]: With dead ends: 41 [2018-12-09 19:25:44,890 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 19:25:44,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:25:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 19:25:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-12-09 19:25:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 19:25:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2018-12-09 19:25:44,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 42 [2018-12-09 19:25:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:44,895 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-12-09 19:25:44,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:25:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2018-12-09 19:25:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 19:25:44,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:44,896 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:44,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:44,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1539529542, now seen corresponding path program 4 times [2018-12-09 19:25:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:44,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 47 proven. 43 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 19:25:44,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:44,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:44,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:44,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:44,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:44,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:44,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:44,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-09 19:25:45,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 99 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-12-09 19:25:45,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:45,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-12-09 19:25:45,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:45,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 19:25:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 19:25:45,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:25:45,322 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 14 states. [2018-12-09 19:25:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,571 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-12-09 19:25:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 19:25:45,572 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-12-09 19:25:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,573 INFO L225 Difference]: With dead ends: 80 [2018-12-09 19:25:45,573 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 19:25:45,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 19:25:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 19:25:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-09 19:25:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 19:25:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-12-09 19:25:45,578 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 68 [2018-12-09 19:25:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:45,578 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-09 19:25:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 19:25:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-12-09 19:25:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 19:25:45,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:45,580 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:45,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:45,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:45,580 INFO L82 PathProgramCache]: Analyzing trace with hash 946234379, now seen corresponding path program 5 times [2018-12-09 19:25:45,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:45,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-12-09 19:25:45,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:45,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:45,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:45,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:45,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:45,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:45,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:25:45,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:25:45,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 19:25:45,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:45,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-12-09 19:25:45,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-12-09 19:25:45,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:45,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-12-09 19:25:45,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:45,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 19:25:45,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 19:25:45,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:25:45,906 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 8 states. [2018-12-09 19:25:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:45,969 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-12-09 19:25:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:25:45,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-12-09 19:25:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:45,970 INFO L225 Difference]: With dead ends: 56 [2018-12-09 19:25:45,970 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 19:25:45,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-12-09 19:25:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 19:25:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-12-09 19:25:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 19:25:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-12-09 19:25:45,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 110 [2018-12-09 19:25:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:45,974 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-12-09 19:25:45,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 19:25:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-12-09 19:25:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-09 19:25:45,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:45,975 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:45,975 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:45,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 551748881, now seen corresponding path program 6 times [2018-12-09 19:25:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:45,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-12-09 19:25:46,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:46,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:46,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:46,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:46,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:46,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:46,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 19:25:46,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 19:25:46,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 19:25:46,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:46,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-12-09 19:25:46,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-12-09 19:25:46,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:46,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-12-09 19:25:46,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:46,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:25:46,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:25:46,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-12-09 19:25:46,751 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 15 states. [2018-12-09 19:25:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:46,980 INFO L93 Difference]: Finished difference Result 112 states and 178 transitions. [2018-12-09 19:25:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:25:46,981 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-12-09 19:25:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:46,982 INFO L225 Difference]: With dead ends: 112 [2018-12-09 19:25:46,982 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 19:25:46,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 19:25:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 19:25:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-09 19:25:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-09 19:25:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-12-09 19:25:46,987 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 137 [2018-12-09 19:25:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:46,988 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-12-09 19:25:46,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:25:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-12-09 19:25:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-09 19:25:46,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:46,989 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:46,989 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:46,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1288458278, now seen corresponding path program 7 times [2018-12-09 19:25:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:46,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 669 proven. 122 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-12-09 19:25:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:47,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:47,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:47,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:47,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:47,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:47,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:47,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:47,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-09 19:25:47,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 693 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2018-12-09 19:25:47,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:47,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 15] total 26 [2018-12-09 19:25:47,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:47,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 19:25:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 19:25:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:25:47,888 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 18 states. [2018-12-09 19:25:48,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:48,215 INFO L93 Difference]: Finished difference Result 145 states and 229 transitions. [2018-12-09 19:25:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 19:25:48,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 205 [2018-12-09 19:25:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:48,217 INFO L225 Difference]: With dead ends: 145 [2018-12-09 19:25:48,217 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 19:25:48,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 389 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=508, Invalid=1562, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 19:25:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 19:25:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2018-12-09 19:25:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 19:25:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2018-12-09 19:25:48,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 205 [2018-12-09 19:25:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:48,227 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2018-12-09 19:25:48,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 19:25:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2018-12-09 19:25:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-09 19:25:48,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:48,230 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:48,231 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:48,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2082787635, now seen corresponding path program 8 times [2018-12-09 19:25:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:48,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 238 proven. 1112 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2018-12-09 19:25:48,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:48,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:48,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:48,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:48,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:48,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:48,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:25:48,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:25:48,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-09 19:25:48,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:48,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 123 refuted. 0 times theorem prover too weak. 4729 trivial. 0 not checked. [2018-12-09 19:25:48,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1187 proven. 134 refuted. 0 times theorem prover too weak. 4718 trivial. 0 not checked. [2018-12-09 19:25:49,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:49,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 20 [2018-12-09 19:25:49,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:49,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 19:25:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 19:25:49,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:25:49,105 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand 15 states. [2018-12-09 19:25:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:49,425 INFO L93 Difference]: Finished difference Result 183 states and 281 transitions. [2018-12-09 19:25:49,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 19:25:49,425 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 328 [2018-12-09 19:25:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:49,426 INFO L225 Difference]: With dead ends: 183 [2018-12-09 19:25:49,427 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 19:25:49,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 641 SyntacticMatches, 11 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 19:25:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 19:25:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 97. [2018-12-09 19:25:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 19:25:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2018-12-09 19:25:49,437 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 328 [2018-12-09 19:25:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:49,437 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2018-12-09 19:25:49,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 19:25:49,437 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2018-12-09 19:25:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-12-09 19:25:49,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:49,445 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:49,445 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:49,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -211711407, now seen corresponding path program 9 times [2018-12-09 19:25:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:49,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:49,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1412 proven. 592 refuted. 0 times theorem prover too weak. 10383 trivial. 0 not checked. [2018-12-09 19:25:49,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:49,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:49,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:49,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:49,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:49,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:49,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 19:25:49,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 19:25:49,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 19:25:49,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:49,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:49,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2018-12-09 19:25:49,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2347 refuted. 0 times theorem prover too weak. 9679 trivial. 0 not checked. [2018-12-09 19:25:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:51,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 19] total 20 [2018-12-09 19:25:51,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:51,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:25:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:25:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:25:51,250 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 12 states. [2018-12-09 19:25:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:51,353 INFO L93 Difference]: Finished difference Result 106 states and 148 transitions. [2018-12-09 19:25:51,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:25:51,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 464 [2018-12-09 19:25:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:51,354 INFO L225 Difference]: With dead ends: 106 [2018-12-09 19:25:51,354 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 19:25:51,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 907 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2018-12-09 19:25:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 19:25:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-09 19:25:51,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-09 19:25:51,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2018-12-09 19:25:51,360 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 464 [2018-12-09 19:25:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:51,361 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2018-12-09 19:25:51,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:25:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2018-12-09 19:25:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-12-09 19:25:51,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:51,365 INFO L402 BasicCegarLoop]: trace histogram [145, 145, 117, 72, 72, 72, 72, 72, 72, 72, 45, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:51,365 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:51,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1787341528, now seen corresponding path program 10 times [2018-12-09 19:25:51,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:51,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:25:51,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:51,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 3584 proven. 4251 refuted. 0 times theorem prover too weak. 50935 trivial. 0 not checked. [2018-12-09 19:25:51,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:51,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:51,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:51,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:51,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:51,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:51,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:51,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:25:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:51,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 29055 proven. 4291 refuted. 0 times theorem prover too weak. 25424 trivial. 0 not checked. [2018-12-09 19:25:52,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 58770 backedges. 2489 proven. 8337 refuted. 0 times theorem prover too weak. 47944 trivial. 0 not checked. [2018-12-09 19:25:55,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:25:55,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 30] total 37 [2018-12-09 19:25:55,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:25:55,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 19:25:55,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 19:25:55,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 19:25:55,611 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand 23 states. [2018-12-09 19:25:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:25:56,141 INFO L93 Difference]: Finished difference Result 235 states and 419 transitions. [2018-12-09 19:25:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 19:25:56,142 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 995 [2018-12-09 19:25:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:25:56,143 INFO L225 Difference]: With dead ends: 235 [2018-12-09 19:25:56,143 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 19:25:56,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 1947 SyntacticMatches, 28 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1071, Invalid=3351, Unknown=0, NotChecked=0, Total=4422 [2018-12-09 19:25:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 19:25:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-12-09 19:25:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 19:25:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2018-12-09 19:25:56,150 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 995 [2018-12-09 19:25:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:25:56,151 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2018-12-09 19:25:56,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 19:25:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2018-12-09 19:25:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2018-12-09 19:25:56,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:25:56,153 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:25:56,153 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:25:56,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:25:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1020040988, now seen corresponding path program 11 times [2018-12-09 19:25:56,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:25:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:25:56,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:25:56,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:25:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:25:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-12-09 19:25:56,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:56,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:25:56,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:25:56,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:25:56,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:25:56,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 19:25:56,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:25:56,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:25:56,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-09 19:25:56,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:25:56,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:25:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-12-09 19:25:57,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:25:58,063 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 19:25:58,190 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:25:58,312 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:25:59,064 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:25:59,348 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:25:59,638 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:25:59,924 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:01,366 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-09 19:26:01,867 WARN L180 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-09 19:26:02,382 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-09 19:26:02,884 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-09 19:26:03,622 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 19:26:03,727 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 19:26:03,838 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:26:03,948 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:26:04,612 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:04,813 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:05,020 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:05,229 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:06,578 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 491 [2018-12-09 19:26:07,823 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 491 [2018-12-09 19:26:09,067 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 493 [2018-12-09 19:26:10,400 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 493 [2018-12-09 19:26:11,985 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:12,195 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:12,410 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:12,636 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:17,238 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:17,460 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:17,705 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:17,929 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:18,662 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 19:26:18,782 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-09 19:26:18,913 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:26:19,051 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-12-09 19:26:19,600 WARN L180 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-09 19:26:20,128 WARN L180 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-12-09 19:26:20,666 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-09 19:26:21,209 WARN L180 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-12-09 19:26:25,168 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:25,385 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-12-09 19:26:25,591 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:25,794 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-12-09 19:26:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-12-09 19:26:29,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:26:29,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2018-12-09 19:26:29,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:26:29,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 19:26:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 19:26:29,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 19:26:29,084 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand 36 states. [2018-12-09 19:26:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:26:29,190 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2018-12-09 19:26:29,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 19:26:29,190 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 750 [2018-12-09 19:26:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:26:29,191 INFO L225 Difference]: With dead ends: 121 [2018-12-09 19:26:29,191 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:26:29,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1723 GetRequests, 1468 SyntacticMatches, 218 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1163, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 19:26:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:26:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:26:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:26:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:26:29,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2018-12-09 19:26:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:26:29,192 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:26:29,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 19:26:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:26:29,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:26:29,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 19:26:29,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:26:29,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 19:26:29,530 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 44 [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L451 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-12-09 19:26:29,532 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (< 1 |fibonacci_#in~n|) (<= fibonacci_~n |fibonacci_#in~n|)) [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse2 (<= 1 |fibonacci_#t~ret0|)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse0 (<= 7 fibonacci_~n)) (.cse1 (<= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7) .cse0 .cse1) (and (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6) (<= 6 fibonacci_~n) .cse1) (and (<= |fibonacci_#in~n| 3) .cse2 (<= 3 fibonacci_~n) .cse1) (and (<= 4 |fibonacci_#in~n|) .cse3 (<= |fibonacci_#in~n| 4) (<= 2 |fibonacci_#t~ret0|) .cse1) (and (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 5) (<= 5 fibonacci_~n) .cse1) (and (<= 13 |fibonacci_#t~ret0|) .cse3 (<= |fibonacci_#in~n| 8) .cse0 .cse1) (and .cse2 (<= |fibonacci_#in~n| 2) (<= 2 fibonacci_~n) .cse1) (and (<= 21 |fibonacci_#t~ret0|) .cse3 .cse0 .cse1))) [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-12-09 19:26:29,532 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 19:26:29,533 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L451 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: true [2018-12-09 19:26:29,533 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2018-12-09 19:26:29,533 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-09 19:26:29,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:26:29 BoogieIcfgContainer [2018-12-09 19:26:29,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:26:29,535 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:26:29,535 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:26:29,535 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:26:29,535 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:25:42" (3/4) ... [2018-12-09 19:26:29,537 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:26:29,541 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-12-09 19:26:29,541 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:26:29,541 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:26:29,543 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 19:26:29,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:26:29,544 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 19:26:29,567 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b65d96d-c864-4b83-a8ed-215dd83c5bb8/bin-2019/utaipan/witness.graphml [2018-12-09 19:26:29,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:26:29,568 INFO L168 Benchmark]: Toolchain (without parser) took 47266.99 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 957.8 MB in the beginning and 979.5 MB in the end (delta: -21.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-09 19:26:29,569 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:29,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:29,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.55 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:29,569 INFO L168 Benchmark]: Boogie Preprocessor took 9.99 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:26:29,569 INFO L168 Benchmark]: RCFGBuilder took 142.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:29,570 INFO L168 Benchmark]: TraceAbstraction took 46939.73 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-09 19:26:29,570 INFO L168 Benchmark]: Witness Printer took 32.57 ms. Allocated memory is still 2.7 GB. Free memory was 1.0 GB in the beginning and 979.5 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:26:29,571 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.73 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.55 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.99 ms. Allocated memory is still 1.0 GB. Free memory is still 947.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 142.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46939.73 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 32.57 ms. Allocated memory is still 2.7 GB. Free memory was 1.0 GB in the beginning and 979.5 MB in the end (delta: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 46.9s OverallTime, 14 OverallIterations, 145 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 338 SDtfs, 732 SDslu, 1392 SDs, 0 SdLazy, 2103 SolverSat, 860 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6863 GetRequests, 6190 SyntacticMatches, 327 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8272 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 60 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 221 PreInvPairs, 332 NumberOfFragments, 128 HoareAnnotationTreeSize, 221 FomulaSimplifications, 1525 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2844 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 41.5s InterpolantComputationTime, 6419 NumberOfCodeBlocks, 6171 NumberOfCodeBlocksAsserted, 148 NumberOfCheckSat, 9576 ConstructedInterpolants, 0 QuantifiedInterpolants, 9072924 SizeOfPredicates, 77 NumberOfNonLiveVariables, 6558 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 301823/343023 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...