./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-1dbac8b [2018-10-27 01:02:59,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 01:02:59,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 01:02:59,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 01:02:59,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 01:02:59,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 01:02:59,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 01:02:59,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 01:02:59,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 01:02:59,781 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 01:02:59,782 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 01:02:59,782 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 01:02:59,783 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 01:02:59,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 01:02:59,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 01:02:59,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 01:02:59,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 01:02:59,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 01:02:59,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 01:02:59,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 01:02:59,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 01:02:59,792 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 01:02:59,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 01:02:59,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 01:02:59,795 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 01:02:59,796 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 01:02:59,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 01:02:59,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 01:02:59,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 01:02:59,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 01:02:59,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 01:02:59,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 01:02:59,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 01:02:59,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 01:02:59,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 01:02:59,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 01:02:59,803 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 01:02:59,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 01:02:59,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 01:02:59,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 01:02:59,816 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 01:02:59,816 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 01:02:59,816 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 01:02:59,816 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 01:02:59,816 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 01:02:59,816 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 01:02:59,817 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 01:02:59,817 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 01:02:59,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 01:02:59,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 01:02:59,818 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 01:02:59,819 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 01:02:59,819 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 01:02:59,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 01:02:59,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 01:02:59,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 01:02:59,820 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 01:02:59,821 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 01:02:59,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 01:02:59,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 01:02:59,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 01:02:59,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 01:02:59,821 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 01:02:59,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 01:02:59,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 01:02:59,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 01:02:59,822 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_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:02:59,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 01:02:59,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 01:02:59,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 01:02:59,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 01:02:59,863 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 01:02:59,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/../../sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 01:02:59,907 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/data/b0dbd6323/9df619b6b01c42d9afbf2296ea8f0d78/FLAGa745aa960 [2018-10-27 01:03:00,284 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 01:03:00,285 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/sv-benchmarks/c/recursive/Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 01:03:00,291 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/data/b0dbd6323/9df619b6b01c42d9afbf2296ea8f0d78/FLAGa745aa960 [2018-10-27 01:03:00,305 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/data/b0dbd6323/9df619b6b01c42d9afbf2296ea8f0d78 [2018-10-27 01:03:00,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 01:03:00,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 01:03:00,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:00,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 01:03:00,317 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 01:03:00,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134f2944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00, skipping insertion in model container [2018-10-27 01:03:00,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 01:03:00,346 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 01:03:00,471 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:00,474 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 01:03:00,487 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 01:03:00,498 INFO L193 MainTranslator]: Completed translation [2018-10-27 01:03:00,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00 WrapperNode [2018-10-27 01:03:00,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 01:03:00,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:00,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 01:03:00,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 01:03:00,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 01:03:00,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 01:03:00,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 01:03:00,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 01:03:00,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... [2018-10-27 01:03:00,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 01:03:00,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 01:03:00,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 01:03:00,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 01:03:00,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2018-10-27 01:03:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2018-10-27 01:03:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 01:03:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 01:03:00,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 01:03:00,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 01:03:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 01:03:00,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 01:03:00,862 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 01:03:00,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:00 BoogieIcfgContainer [2018-10-27 01:03:00,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 01:03:00,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 01:03:00,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 01:03:00,867 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 01:03:00,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 01:03:00" (1/3) ... [2018-10-27 01:03:00,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9449994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:00, skipping insertion in model container [2018-10-27 01:03:00,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 01:03:00" (2/3) ... [2018-10-27 01:03:00,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9449994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 01:03:00, skipping insertion in model container [2018-10-27 01:03:00,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:00" (3/3) ... [2018-10-27 01:03:00,871 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci03_true-unreach-call_true-no-overflow_true-termination.c [2018-10-27 01:03:00,879 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 01:03:00,886 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 01:03:00,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 01:03:00,926 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 01:03:00,926 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 01:03:00,926 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 01:03:00,926 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 01:03:00,927 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 01:03:00,927 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 01:03:00,927 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 01:03:00,927 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 01:03:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-10-27 01:03:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 01:03:00,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:00,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:00,950 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:00,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:00,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1900973920, now seen corresponding path program 1 times [2018-10-27 01:03:00,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:01,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:01,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 01:03:01,320 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:01,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 01:03:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 01:03:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 01:03:01,338 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-10-27 01:03:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:01,521 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-10-27 01:03:01,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 01:03:01,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-27 01:03:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:01,529 INFO L225 Difference]: With dead ends: 36 [2018-10-27 01:03:01,529 INFO L226 Difference]: Without dead ends: 22 [2018-10-27 01:03:01,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:01,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-27 01:03:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 01:03:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 01:03:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-10-27 01:03:01,562 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2018-10-27 01:03:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:01,562 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 01:03:01,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 01:03:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-10-27 01:03:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 01:03:01,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:01,564 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:01,564 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:01,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:01,564 INFO L82 PathProgramCache]: Analyzing trace with hash -509871596, now seen corresponding path program 1 times [2018-10-27 01:03:01,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 01:03:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 01:03:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 01:03:01,633 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 01:03:01,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 01:03:01,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 01:03:01,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 01:03:01,635 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2018-10-27 01:03:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:01,884 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 01:03:01,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 01:03:01,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 01:03:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:01,886 INFO L225 Difference]: With dead ends: 28 [2018-10-27 01:03:01,886 INFO L226 Difference]: Without dead ends: 24 [2018-10-27 01:03:01,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-27 01:03:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-27 01:03:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-10-27 01:03:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 01:03:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-10-27 01:03:01,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2018-10-27 01:03:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:01,892 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 01:03:01,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 01:03:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-10-27 01:03:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 01:03:01,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:01,894 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:01,894 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:01,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1203666899, now seen corresponding path program 1 times [2018-10-27 01:03:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:01,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:02,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 01:03:02,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:02,037 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:02,037 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-27 01:03:02,040 INFO L202 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [22], [24], [28], [30], [33], [34], [35], [36], [37], [38], [39], [41], [42] [2018-10-27 01:03:02,081 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:03:02,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:03:02,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:03:02,211 INFO L272 AbstractInterpreter]: Visited 17 different actions 32 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-10-27 01:03:02,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:02,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:03:02,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:02,272 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:02,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:02,279 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:02,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:02,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 01:03:02,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 01:03:02,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:02,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2018-10-27 01:03:02,763 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:02,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 01:03:02,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 01:03:02,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-10-27 01:03:02,765 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2018-10-27 01:03:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:03,089 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-10-27 01:03:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 01:03:03,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-27 01:03:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:03,090 INFO L225 Difference]: With dead ends: 39 [2018-10-27 01:03:03,090 INFO L226 Difference]: Without dead ends: 24 [2018-10-27 01:03:03,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-27 01:03:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-27 01:03:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 01:03:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 01:03:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-10-27 01:03:03,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 27 [2018-10-27 01:03:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:03,096 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-10-27 01:03:03,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 01:03:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-10-27 01:03:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 01:03:03,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:03,097 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:03,098 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:03,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash -603082491, now seen corresponding path program 1 times [2018-10-27 01:03:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:03,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:03:03,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:03,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:03,147 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-27 01:03:03,147 INFO L202 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-10-27 01:03:03,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 01:03:03,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 01:03:06,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 01:03:06,412 INFO L272 AbstractInterpreter]: Visited 23 different actions 6847 times. Merged at 10 different actions 1830 times. Never widened. Found 730 fixpoints after 5 different actions. Largest state had 5 variables. [2018-10-27 01:03:06,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:06,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 01:03:06,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:06,463 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:06,474 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:06,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 01:03:06,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 01:03:06,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:06,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-27 01:03:06,815 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:06,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:06,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 01:03:06,816 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2018-10-27 01:03:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:06,905 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-10-27 01:03:06,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:06,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-10-27 01:03:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:06,907 INFO L225 Difference]: With dead ends: 33 [2018-10-27 01:03:06,907 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 01:03:06,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-27 01:03:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 01:03:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-27 01:03:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 01:03:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-10-27 01:03:06,919 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 28 [2018-10-27 01:03:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:06,919 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-10-27 01:03:06,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-10-27 01:03:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-27 01:03:06,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:06,921 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:06,921 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:06,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2046185202, now seen corresponding path program 2 times [2018-10-27 01:03:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:06,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 01:03:07,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:07,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:07,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:07,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:07,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:07,096 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:07,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 01:03:07,108 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 01:03:07,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 01:03:07,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:07,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 01:03:07,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 01:03:07,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2018-10-27 01:03:07,465 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:07,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 01:03:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 01:03:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 01:03:07,465 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 6 states. [2018-10-27 01:03:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:07,529 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-10-27 01:03:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 01:03:07,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-27 01:03:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:07,531 INFO L225 Difference]: With dead ends: 39 [2018-10-27 01:03:07,531 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 01:03:07,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-27 01:03:07,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 01:03:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-27 01:03:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 01:03:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-10-27 01:03:07,539 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 41 [2018-10-27 01:03:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:07,539 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-10-27 01:03:07,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 01:03:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2018-10-27 01:03:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 01:03:07,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:07,541 INFO L375 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-10-27 01:03:07,541 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:07,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1391487784, now seen corresponding path program 3 times [2018-10-27 01:03:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:07,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:07,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 01:03:07,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:07,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:07,607 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:07,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:07,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:07,607 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:07,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 01:03:07,614 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 01:03:07,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 01:03:07,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:07,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 01:03:07,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 01:03:07,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:07,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 12 [2018-10-27 01:03:07,952 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:07,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 01:03:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 01:03:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-27 01:03:07,952 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 7 states. [2018-10-27 01:03:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:08,041 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2018-10-27 01:03:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 01:03:08,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-27 01:03:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:08,043 INFO L225 Difference]: With dead ends: 41 [2018-10-27 01:03:08,043 INFO L226 Difference]: Without dead ends: 37 [2018-10-27 01:03:08,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-27 01:03:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-27 01:03:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-27 01:03:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-27 01:03:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2018-10-27 01:03:08,051 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 42 [2018-10-27 01:03:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:08,052 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-10-27 01:03:08,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 01:03:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2018-10-27 01:03:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-27 01:03:08,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:08,054 INFO L375 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-10-27 01:03:08,056 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:08,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1539529542, now seen corresponding path program 4 times [2018-10-27 01:03:08,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:08,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:08,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 47 proven. 43 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-10-27 01:03:08,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:08,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:08,199 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:08,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:08,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:08,199 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:08,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:08,207 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:08,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:08,321 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 01:03:08,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 17 proven. 99 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-10-27 01:03:08,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:08,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 20 [2018-10-27 01:03:08,929 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:08,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 01:03:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 01:03:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-10-27 01:03:08,930 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 14 states. [2018-10-27 01:03:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:09,728 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-10-27 01:03:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 01:03:09,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2018-10-27 01:03:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:09,730 INFO L225 Difference]: With dead ends: 80 [2018-10-27 01:03:09,730 INFO L226 Difference]: Without dead ends: 51 [2018-10-27 01:03:09,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 119 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=771, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 01:03:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-27 01:03:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-10-27 01:03:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 01:03:09,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-10-27 01:03:09,738 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 68 [2018-10-27 01:03:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:09,738 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-10-27 01:03:09,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 01:03:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-10-27 01:03:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 01:03:09,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:09,740 INFO L375 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-10-27 01:03:09,740 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:09,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash 946234379, now seen corresponding path program 5 times [2018-10-27 01:03:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:09,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:09,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:09,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:09,742 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 174 proven. 59 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2018-10-27 01:03:09,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:09,862 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:09,862 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:09,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:09,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:09,862 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 01:03:09,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 01:03:09,881 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:09,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 01:03:09,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:09,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:09,955 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 41 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-10-27 01:03:09,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 141 proven. 50 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2018-10-27 01:03:10,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:10,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 13 [2018-10-27 01:03:10,293 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:10,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 01:03:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 01:03:10,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 01:03:10,294 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 8 states. [2018-10-27 01:03:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:10,395 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2018-10-27 01:03:10,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 01:03:10,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-10-27 01:03:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:10,397 INFO L225 Difference]: With dead ends: 56 [2018-10-27 01:03:10,397 INFO L226 Difference]: Without dead ends: 52 [2018-10-27 01:03:10,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 214 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2018-10-27 01:03:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-27 01:03:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-10-27 01:03:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 01:03:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-10-27 01:03:10,403 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 110 [2018-10-27 01:03:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:10,404 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-10-27 01:03:10,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 01:03:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-10-27 01:03:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-27 01:03:10,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:10,406 INFO L375 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-10-27 01:03:10,406 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:10,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:10,406 INFO L82 PathProgramCache]: Analyzing trace with hash 551748881, now seen corresponding path program 6 times [2018-10-27 01:03:10,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:10,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:10,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:10,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:10,529 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2018-10-27 01:03:10,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:10,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:10,529 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:10,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:10,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:10,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 01:03:10,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 01:03:10,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 01:03:10,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:10,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 343 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-10-27 01:03:10,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 365 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2018-10-27 01:03:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:11,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 18] total 23 [2018-10-27 01:03:11,659 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:11,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 01:03:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 01:03:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-27 01:03:11,660 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 15 states. [2018-10-27 01:03:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:12,002 INFO L93 Difference]: Finished difference Result 112 states and 178 transitions. [2018-10-27 01:03:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 01:03:12,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2018-10-27 01:03:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:12,004 INFO L225 Difference]: With dead ends: 112 [2018-10-27 01:03:12,004 INFO L226 Difference]: Without dead ends: 67 [2018-10-27 01:03:12,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1035, Unknown=0, NotChecked=0, Total=1406 [2018-10-27 01:03:12,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-27 01:03:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-10-27 01:03:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-27 01:03:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-10-27 01:03:12,012 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 137 [2018-10-27 01:03:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:12,012 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-10-27 01:03:12,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 01:03:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-10-27 01:03:12,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 01:03:12,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:12,015 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:12,015 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:12,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:12,015 INFO L82 PathProgramCache]: Analyzing trace with hash -516480259, now seen corresponding path program 7 times [2018-10-27 01:03:12,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:12,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:12,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2018-10-27 01:03:12,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:12,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:12,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:12,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:12,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:12,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:12,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:12,148 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:12,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2018-10-27 01:03:12,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2018-10-27 01:03:13,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:13,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 15] total 18 [2018-10-27 01:03:13,232 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:13,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 01:03:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 01:03:13,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-27 01:03:13,233 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 10 states. [2018-10-27 01:03:13,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:13,369 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2018-10-27 01:03:13,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 01:03:13,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-10-27 01:03:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:13,371 INFO L225 Difference]: With dead ends: 72 [2018-10-27 01:03:13,371 INFO L226 Difference]: Without dead ends: 68 [2018-10-27 01:03:13,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 423 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2018-10-27 01:03:13,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-27 01:03:13,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-27 01:03:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-27 01:03:13,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2018-10-27 01:03:13,385 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 219 [2018-10-27 01:03:13,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:13,386 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2018-10-27 01:03:13,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 01:03:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2018-10-27 01:03:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-27 01:03:13,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:13,390 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:13,391 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:13,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:13,391 INFO L82 PathProgramCache]: Analyzing trace with hash 177464299, now seen corresponding path program 8 times [2018-10-27 01:03:13,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:13,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:13,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:13,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 829 proven. 826 refuted. 0 times theorem prover too weak. 5465 trivial. 0 not checked. [2018-10-27 01:03:13,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:13,679 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:13,679 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:13,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:13,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:13,679 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:13,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 01:03:13,686 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 01:03:13,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-27 01:03:13,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:13,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1310 proven. 123 refuted. 0 times theorem prover too weak. 5687 trivial. 0 not checked. [2018-10-27 01:03:13,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1310 proven. 134 refuted. 0 times theorem prover too weak. 5676 trivial. 0 not checked. [2018-10-27 01:03:15,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:15,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 13] total 22 [2018-10-27 01:03:15,277 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:15,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 01:03:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 01:03:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-10-27 01:03:15,278 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 17 states. [2018-10-27 01:03:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:15,655 INFO L93 Difference]: Finished difference Result 142 states and 230 transitions. [2018-10-27 01:03:15,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 01:03:15,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 355 [2018-10-27 01:03:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:15,658 INFO L225 Difference]: With dead ends: 142 [2018-10-27 01:03:15,658 INFO L226 Difference]: Without dead ends: 81 [2018-10-27 01:03:15,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 693 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 01:03:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-27 01:03:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-10-27 01:03:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 01:03:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 101 transitions. [2018-10-27 01:03:15,670 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 101 transitions. Word has length 355 [2018-10-27 01:03:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:15,671 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 101 transitions. [2018-10-27 01:03:15,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 01:03:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 101 transitions. [2018-10-27 01:03:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-27 01:03:15,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:15,676 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:15,676 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:15,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 521950619, now seen corresponding path program 9 times [2018-10-27 01:03:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:15,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:15,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:15,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 248 proven. 1232 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2018-10-27 01:03:15,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:15,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:15,956 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:15,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:15,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:15,956 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 01:03:15,963 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 01:03:16,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 01:03:16,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:16,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 915 proven. 1793 refuted. 0 times theorem prover too weak. 4412 trivial. 0 not checked. [2018-10-27 01:03:16,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:17,207 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 01:03:17,572 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-27 01:03:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 911 proven. 1859 refuted. 0 times theorem prover too weak. 4350 trivial. 0 not checked. [2018-10-27 01:03:18,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:18,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 26] total 31 [2018-10-27 01:03:18,958 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:18,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 01:03:18,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 01:03:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2018-10-27 01:03:18,960 INFO L87 Difference]: Start difference. First operand 75 states and 101 transitions. Second operand 19 states. [2018-10-27 01:03:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:19,516 INFO L93 Difference]: Finished difference Result 178 states and 283 transitions. [2018-10-27 01:03:19,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 01:03:19,517 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 355 [2018-10-27 01:03:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:19,519 INFO L225 Difference]: With dead ends: 178 [2018-10-27 01:03:19,519 INFO L226 Difference]: Without dead ends: 110 [2018-10-27 01:03:19,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 672 SyntacticMatches, 23 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=759, Invalid=2321, Unknown=0, NotChecked=0, Total=3080 [2018-10-27 01:03:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-27 01:03:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2018-10-27 01:03:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-27 01:03:19,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2018-10-27 01:03:19,530 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 355 [2018-10-27 01:03:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:19,531 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2018-10-27 01:03:19,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 01:03:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2018-10-27 01:03:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-10-27 01:03:19,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:19,534 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:19,534 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:19,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:19,534 INFO L82 PathProgramCache]: Analyzing trace with hash -211711407, now seen corresponding path program 10 times [2018-10-27 01:03:19,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:19,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:19,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1412 proven. 592 refuted. 0 times theorem prover too weak. 10383 trivial. 0 not checked. [2018-10-27 01:03:20,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:20,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:20,219 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:20,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:20,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:20,219 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:20,227 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:20,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2018-10-27 01:03:20,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2347 refuted. 0 times theorem prover too weak. 9679 trivial. 0 not checked. [2018-10-27 01:03:22,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 19] total 20 [2018-10-27 01:03:22,929 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:22,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-27 01:03:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 01:03:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-27 01:03:22,930 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand 12 states. [2018-10-27 01:03:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:23,232 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2018-10-27 01:03:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 01:03:23,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 464 [2018-10-27 01:03:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:23,235 INFO L225 Difference]: With dead ends: 108 [2018-10-27 01:03:23,235 INFO L226 Difference]: Without dead ends: 104 [2018-10-27 01:03:23,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 907 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=495, Unknown=0, NotChecked=0, Total=756 [2018-10-27 01:03:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-27 01:03:23,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-27 01:03:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-27 01:03:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2018-10-27 01:03:23,249 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 464 [2018-10-27 01:03:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:23,250 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2018-10-27 01:03:23,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-27 01:03:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2018-10-27 01:03:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-10-27 01:03:23,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:23,258 INFO L375 BasicCegarLoop]: trace histogram [159, 159, 128, 79, 79, 79, 79, 79, 79, 79, 49, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:23,259 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:23,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:23,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1252715957, now seen corresponding path program 11 times [2018-10-27 01:03:23,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:23,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:23,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:23,260 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:23,994 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-27 01:03:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 3947 proven. 5169 refuted. 0 times theorem prover too weak. 61580 trivial. 0 not checked. [2018-10-27 01:03:24,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:24,369 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:24,369 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:24,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:24,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:24,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/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-10-27 01:03:24,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 01:03:24,385 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 01:03:24,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-10-27 01:03:24,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:25,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 23804 proven. 296 refuted. 0 times theorem prover too weak. 46596 trivial. 0 not checked. [2018-10-27 01:03:25,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 70696 backedges. 6211 proven. 1326 refuted. 0 times theorem prover too weak. 63159 trivial. 0 not checked. [2018-10-27 01:03:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 17] total 25 [2018-10-27 01:03:28,625 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:28,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 01:03:28,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 01:03:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-10-27 01:03:28,627 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 18 states. [2018-10-27 01:03:29,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:29,390 INFO L93 Difference]: Finished difference Result 210 states and 334 transitions. [2018-10-27 01:03:29,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 01:03:29,394 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1090 [2018-10-27 01:03:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:29,396 INFO L225 Difference]: With dead ends: 210 [2018-10-27 01:03:29,396 INFO L226 Difference]: Without dead ends: 115 [2018-10-27 01:03:29,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2215 GetRequests, 2162 SyntacticMatches, 15 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=1146, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 01:03:29,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-27 01:03:29,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-10-27 01:03:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-27 01:03:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2018-10-27 01:03:29,407 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 1090 [2018-10-27 01:03:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:29,408 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2018-10-27 01:03:29,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 01:03:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2018-10-27 01:03:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2018-10-27 01:03:29,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:29,417 INFO L375 BasicCegarLoop]: trace histogram [141, 141, 114, 70, 70, 70, 70, 70, 70, 70, 44, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 01:03:29,417 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1047200934, now seen corresponding path program 12 times [2018-10-27 01:03:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:29,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:29,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:29,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55581 backedges. 6549 proven. 1650 refuted. 0 times theorem prover too weak. 47382 trivial. 0 not checked. [2018-10-27 01:03:30,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:30,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:30,034 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:30,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:30,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:30,034 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:30,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 01:03:30,041 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 01:03:30,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 01:03:30,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 01:03:30,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55581 backedges. 28812 proven. 3686 refuted. 0 times theorem prover too weak. 23083 trivial. 0 not checked. [2018-10-27 01:03:30,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:31,074 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 01:03:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55581 backedges. 2305 proven. 8202 refuted. 0 times theorem prover too weak. 45074 trivial. 0 not checked. [2018-10-27 01:03:34,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:03:34,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 30] total 37 [2018-10-27 01:03:34,679 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:03:34,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 01:03:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 01:03:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 01:03:34,681 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand 23 states. [2018-10-27 01:03:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:03:35,354 INFO L93 Difference]: Finished difference Result 212 states and 364 transitions. [2018-10-27 01:03:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-27 01:03:35,370 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 968 [2018-10-27 01:03:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:03:35,372 INFO L225 Difference]: With dead ends: 212 [2018-10-27 01:03:35,372 INFO L226 Difference]: Without dead ends: 124 [2018-10-27 01:03:35,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1982 GetRequests, 1897 SyntacticMatches, 28 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=841, Invalid=2581, Unknown=0, NotChecked=0, Total=3422 [2018-10-27 01:03:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-27 01:03:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2018-10-27 01:03:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-27 01:03:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2018-10-27 01:03:35,383 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 968 [2018-10-27 01:03:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:03:35,384 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2018-10-27 01:03:35,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 01:03:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2018-10-27 01:03:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 751 [2018-10-27 01:03:35,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 01:03:35,390 INFO L375 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-10-27 01:03:35,391 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 01:03:35,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 01:03:35,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1020040988, now seen corresponding path program 13 times [2018-10-27 01:03:35,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 01:03:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:35,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 01:03:35,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 01:03:35,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 01:03:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-10-27 01:03:36,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:36,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 01:03:36,680 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 01:03:36,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 01:03:36,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 01:03:36,680 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 01:03:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 01:03:36,689 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 01:03:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 01:03:36,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 01:03:37,754 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-10-27 01:03:37,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 01:03:38,616 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:38,722 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:38,831 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:38,938 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:39,647 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:39,892 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:40,145 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:40,391 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:41,178 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:41,281 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:41,388 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:41,506 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:42,156 WARN L179 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-10-27 01:03:42,755 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-10-27 01:03:43,357 WARN L179 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-10-27 01:03:43,961 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-10-27 01:03:44,719 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:44,825 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:44,934 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:45,042 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:45,747 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:45,995 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:46,248 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:46,516 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:48,104 WARN L179 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 491 [2018-10-27 01:03:49,693 WARN L179 SmtUtils]: Spent 1.57 s on a formula simplification that was a NOOP. DAG size: 491 [2018-10-27 01:03:51,201 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 493 [2018-10-27 01:03:52,713 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 493 [2018-10-27 01:03:53,966 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:54,076 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:54,189 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:54,302 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:55,031 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:55,288 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:03:55,556 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:55,824 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:03:58,568 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:58,675 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:03:58,788 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:03:58,899 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:01,170 WARN L179 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 01:04:01,443 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 01:04:02,286 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:02,393 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:02,502 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:02,612 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:03,320 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:04:03,569 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:04:03,824 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:04:04,079 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:04:04,854 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:04,958 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:05,068 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:05,176 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:05,824 WARN L179 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-10-27 01:04:06,526 WARN L179 SmtUtils]: Spent 694.00 ms on a formula simplification that was a NOOP. DAG size: 302 [2018-10-27 01:04:07,187 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-10-27 01:04:07,798 WARN L179 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 304 [2018-10-27 01:04:08,605 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:08,710 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:08,821 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:08,931 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:11,154 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:11,263 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:11,376 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:11,490 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:12,204 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:04:12,452 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-10-27 01:04:12,707 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:04:12,959 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-10-27 01:04:14,825 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:14,928 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 01:04:15,036 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:15,142 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-10-27 01:04:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 5957 proven. 4942 refuted. 0 times theorem prover too weak. 22197 trivial. 0 not checked. [2018-10-27 01:04:16,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 01:04:16,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 36 [2018-10-27 01:04:16,802 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 01:04:16,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-27 01:04:16,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 01:04:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1013, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 01:04:16,803 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand 36 states. [2018-10-27 01:04:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 01:04:16,926 INFO L93 Difference]: Finished difference Result 106 states and 149 transitions. [2018-10-27 01:04:16,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-27 01:04:16,926 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 750 [2018-10-27 01:04:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 01:04:16,928 INFO L225 Difference]: With dead ends: 106 [2018-10-27 01:04:16,928 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 01:04:16,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1468 SyntacticMatches, 218 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5500 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 01:04:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 01:04:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 01:04:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 01:04:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 01:04:16,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 750 [2018-10-27 01:04:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 01:04:16,930 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 01:04:16,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-27 01:04:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 01:04:16,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 01:04:16,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 01:04:18,106 WARN L179 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 7 [2018-10-27 01:04:18,488 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 1 [2018-10-27 01:04:19,629 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 112 DAG size of output: 45 [2018-10-27 01:04:19,630 INFO L425 ceAbstractionStarter]: For program point fibonacciFINAL(lines 14 22) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L428 ceAbstractionStarter]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2018-10-27 01:04:19,631 INFO L421 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= |fibonacci_#in~n| fibonacci_~n) (<= 2 fibonacci_~n) (<= fibonacci_~n |fibonacci_#in~n|)) [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L421 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (<= 8 fibonacci_~n)) (.cse3 (<= |fibonacci_#in~n| fibonacci_~n)) (.cse2 (<= 1 |fibonacci_#t~ret0|)) (.cse1 (<= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= 13 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 8) .cse0 .cse1) (and (<= 8 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 7) (<= 7 fibonacci_~n) .cse1) (and .cse2 (<= |fibonacci_#in~n| 2) (<= 2 fibonacci_~n) .cse1) (and (<= 21 |fibonacci_#t~ret0|) .cse3 .cse0 .cse1) (and (<= 3 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 5) (<= 5 fibonacci_~n) .cse1) (and (<= 5 |fibonacci_#t~ret0|) (<= |fibonacci_#in~n| 6) (<= 6 fibonacci_~n) .cse1) (and (<= 4 |fibonacci_#in~n|) .cse3 (<= |fibonacci_#in~n| 4) (<= 2 |fibonacci_#t~ret0|) .cse1) (and (<= |fibonacci_#in~n| 3) .cse2 (<= 3 fibonacci_~n) .cse1))) [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point fibonacciEXIT(lines 14 22) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point L17(lines 17 21) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 21) no Hoare annotation was computed. [2018-10-27 01:04:19,631 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 01:04:19,631 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 01:04:19,632 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 35) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L428 ceAbstractionStarter]: At program point L30(line 30) the Hoare annotation is: true [2018-10-27 01:04:19,632 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 29) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 25 36) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 25 36) no Hoare annotation was computed. [2018-10-27 01:04:19,632 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-27 01:04:19,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 01:04:19 BoogieIcfgContainer [2018-10-27 01:04:19,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 01:04:19,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 01:04:19,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 01:04:19,635 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 01:04:19,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 01:03:00" (3/4) ... [2018-10-27 01:04:19,638 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 01:04:19,644 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2018-10-27 01:04:19,644 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 01:04:19,644 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 01:04:19,648 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-27 01:04:19,648 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-27 01:04:19,648 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 01:04:19,682 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_039e4686-e09e-44df-b099-683fa816aecf/bin-2019/utaipan/witness.graphml [2018-10-27 01:04:19,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 01:04:19,683 INFO L168 Benchmark]: Toolchain (without parser) took 79374.21 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 959.7 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-10-27 01:04:19,684 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:04:19,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:04:19,684 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.34 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:04:19,684 INFO L168 Benchmark]: Boogie Preprocessor took 15.55 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 01:04:19,685 INFO L168 Benchmark]: RCFGBuilder took 329.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-27 01:04:19,685 INFO L168 Benchmark]: TraceAbstraction took 78770.92 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-10-27 01:04:19,689 INFO L168 Benchmark]: Witness Printer took 47.57 ms. Allocated memory is still 3.9 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 01:04:19,691 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.55 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 948.9 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 17.34 ms. Allocated memory is still 1.0 GB. Free memory is still 948.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.55 ms. Allocated memory is still 1.0 GB. Free memory was 948.9 MB in the beginning and 946.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 329.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78770.92 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 47.57 ms. Allocated memory is still 3.9 GB. Free memory is still 2.2 GB. There was no memory consumed. 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, 78.7s OverallTime, 16 OverallIterations, 159 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 412 SDtfs, 715 SDslu, 1745 SDs, 0 SdLazy, 2764 SolverSat, 752 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9826 GetRequests, 9060 SyntacticMatches, 365 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8877 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 74 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 257 PreInvPairs, 334 NumberOfFragments, 124 HoareAnnotationTreeSize, 257 FomulaSimplifications, 910 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2423 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 63.5s InterpolantComputationTime, 9337 NumberOfCodeBlocks, 8270 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 13947 ConstructedInterpolants, 0 QuantifiedInterpolants, 13627396 SizeOfPredicates, 99 NumberOfNonLiveVariables, 7830 ConjunctsInSsa, 395 ConjunctsInUnsatCore, 44 InterpolantComputations, 2 PerfectInterpolantSequences, 521345/571164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...