./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/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 d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:58:30,918 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:58:30,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:58:30,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:58:30,925 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:58:30,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:58:30,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:58:30,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:58:30,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:58:30,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:58:30,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:58:30,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:58:30,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:58:30,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:58:30,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:58:30,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:58:30,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:58:30,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:58:30,935 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:58:30,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:58:30,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:58:30,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:58:30,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:58:30,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:58:30,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:58:30,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:58:30,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:58:30,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:58:30,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:58:30,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:58:30,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:58:30,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:58:30,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:58:30,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:58:30,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:58:30,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:58:30,943 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:58:30,950 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:58:30,950 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:58:30,951 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:58:30,951 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:58:30,951 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:58:30,951 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:58:30,952 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:58:30,953 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:58:30,953 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:58:30,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:58:30,953 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:58:30,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:58:30,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:58:30,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:58:30,954 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:58:30,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:58:30,955 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:58:30,955 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_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/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 -> d1286ba4e4f9d6c67aa5e4ab5d636bfd3afce4b1 [2018-12-02 07:58:30,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:58:30,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:58:30,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:58:30,983 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:58:30,983 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:58:30,984 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 07:58:31,019 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/data/197f77984/94544674183b41659f1e24dcb30b0389/FLAGdb0a5a225 [2018-12-02 07:58:31,352 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:58:31,353 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/sv-benchmarks/c/recursive-simple/id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 07:58:31,357 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/data/197f77984/94544674183b41659f1e24dcb30b0389/FLAGdb0a5a225 [2018-12-02 07:58:31,757 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/data/197f77984/94544674183b41659f1e24dcb30b0389 [2018-12-02 07:58:31,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:58:31,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:58:31,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:58:31,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:58:31,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:58:31,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709ce3e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31, skipping insertion in model container [2018-12-02 07:58:31,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:58:31,783 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:58:31,863 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:58:31,865 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:58:31,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:58:31,880 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:58:31,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31 WrapperNode [2018-12-02 07:58:31,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:58:31,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:58:31,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:58:31,881 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:58:31,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:58:31,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:58:31,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:58:31,893 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:58:31,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... [2018-12-02 07:58:31,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:58:31,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:58:31,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:58:31,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:58:31,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:58:31,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:58:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:58:31,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:58:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:58:31,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:58:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:58:31,963 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-12-02 07:58:31,963 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-12-02 07:58:32,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:58:32,036 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 07:58:32,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:32 BoogieIcfgContainer [2018-12-02 07:58:32,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:58:32,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:58:32,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:58:32,038 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:58:32,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:58:31" (1/3) ... [2018-12-02 07:58:32,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b783a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:58:32, skipping insertion in model container [2018-12-02 07:58:32,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:58:31" (2/3) ... [2018-12-02 07:58:32,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b783a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:58:32, skipping insertion in model container [2018-12-02 07:58:32,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:32" (3/3) ... [2018-12-02 07:58:32,040 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o20_false-unreach-call_true-termination_true-no-overflow.c [2018-12-02 07:58:32,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:58:32,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 07:58:32,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 07:58:32,079 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:58:32,079 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:58:32,079 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:58:32,079 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:58:32,079 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:58:32,079 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:58:32,080 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:58:32,080 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:58:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-02 07:58:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 07:58:32,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:32,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:32,095 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:32,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-12-02 07:58:32,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:58:32,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:58:32,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 07:58:32,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:58:32,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 07:58:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 07:58:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:58:32,236 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-02 07:58:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:32,260 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-02 07:58:32,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:58:32,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 07:58:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:32,267 INFO L225 Difference]: With dead ends: 32 [2018-12-02 07:58:32,267 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 07:58:32,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 07:58:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 07:58:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 07:58:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 07:58:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-02 07:58:32,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-02 07:58:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-02 07:58:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 07:58:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-02 07:58:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 07:58:32,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:32,294 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:32,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:32,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-12-02 07:58:32,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:58:32,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:32,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:32,379 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 07:58:32,380 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-12-02 07:58:32,405 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:58:32,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:58:32,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:58:32,506 INFO L272 AbstractInterpreter]: Visited 17 different actions 57 times. Merged at 5 different actions 21 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-12-02 07:58:32,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:32,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:58:32,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:32,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:32,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:32,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:32,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:58:32,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 07:58:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 07:58:32,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:32,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 07:58:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 07:58:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:58:32,666 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-12-02 07:58:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:32,684 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-02 07:58:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 07:58:32,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-02 07:58:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:32,685 INFO L225 Difference]: With dead ends: 25 [2018-12-02 07:58:32,685 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 07:58:32,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-12-02 07:58:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 07:58:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 07:58:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 07:58:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 07:58:32,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-02 07:58:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:32,691 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 07:58:32,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 07:58:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-02 07:58:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 07:58:32,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:32,692 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:32,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:32,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-12-02 07:58:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 07:58:32,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:32,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:32,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:32,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:32,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:32,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:32,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:32,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 07:58:32,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:32,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 07:58:32,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 07:58:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:32,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 07:58:32,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:32,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 07:58:32,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:58:32,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 07:58:32,966 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-12-02 07:58:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:32,989 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-12-02 07:58:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 07:58:32,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-02 07:58:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:32,990 INFO L225 Difference]: With dead ends: 28 [2018-12-02 07:58:32,990 INFO L226 Difference]: Without dead ends: 24 [2018-12-02 07:58:32,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-02 07:58:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-02 07:58:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 07:58:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 07:58:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-02 07:58:32,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-12-02 07:58:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-02 07:58:32,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 07:58:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-02 07:58:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 07:58:32,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:32,996 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:32,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:32,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-12-02 07:58:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:32,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:58:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:33,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:33,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:33,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:33,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:33,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:33,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:33,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:58:33,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 07:58:33,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:33,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 07:58:33,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:33,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 07:58:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 07:58:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-02 07:58:33,341 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-12-02 07:58:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:33,367 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-02 07:58:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 07:58:33,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-02 07:58:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:33,368 INFO L225 Difference]: With dead ends: 31 [2018-12-02 07:58:33,368 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 07:58:33,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-02 07:58:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 07:58:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 07:58:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 07:58:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 07:58:33,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-12-02 07:58:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:33,372 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 07:58:33,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 07:58:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 07:58:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 07:58:33,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:33,373 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:33,373 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:33,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-12-02 07:58:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:33,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:33,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 07:58:33,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:33,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:33,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:33,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:33,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:33,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:33,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 07:58:33,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-02 07:58:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-02 07:58:33,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:33,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 07:58:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 07:58:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-12-02 07:58:33,819 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-02 07:58:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:33,853 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-12-02 07:58:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 07:58:33,854 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-02 07:58:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:33,854 INFO L225 Difference]: With dead ends: 34 [2018-12-02 07:58:33,854 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 07:58:33,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-12-02 07:58:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 07:58:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 07:58:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 07:58:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-02 07:58:33,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-12-02 07:58:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:33,858 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-02 07:58:33,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 07:58:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-02 07:58:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 07:58:33,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:33,859 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:33,859 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:33,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:33,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-12-02 07:58:33,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:33,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:33,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 07:58:33,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:33,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:33,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:33,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:33,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:33,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:33,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:34,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 07:58:34,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:34,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 07:58:34,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 07:58:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-02 07:58:34,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 07:58:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 07:58:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-12-02 07:58:34,398 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-12-02 07:58:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:34,443 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-02 07:58:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 07:58:34,443 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-12-02 07:58:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:34,443 INFO L225 Difference]: With dead ends: 37 [2018-12-02 07:58:34,444 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 07:58:34,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2018-12-02 07:58:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 07:58:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 07:58:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 07:58:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 07:58:34,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-12-02 07:58:34,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:34,447 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 07:58:34,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 07:58:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 07:58:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 07:58:34,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:34,448 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:34,448 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:34,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-12-02 07:58:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:34,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:34,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:34,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 07:58:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:34,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:34,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:34,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:34,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:34,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:34,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:34,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:34,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 07:58:34,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-12-02 07:58:35,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:35,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-02 07:58:35,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:35,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 07:58:35,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 07:58:35,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 07:58:35,090 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 18 states. [2018-12-02 07:58:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:35,160 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-12-02 07:58:35,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 07:58:35,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-12-02 07:58:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:35,161 INFO L225 Difference]: With dead ends: 40 [2018-12-02 07:58:35,161 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 07:58:35,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 07:58:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 07:58:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 07:58:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 07:58:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-02 07:58:35,165 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-12-02 07:58:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:35,165 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-02 07:58:35,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 07:58:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-02 07:58:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 07:58:35,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:35,166 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:35,166 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:35,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-12-02 07:58:35,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:35,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:35,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:35,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 07:58:35,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:35,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:35,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:35,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:35,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:35,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:35,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:35,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:35,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 07:58:35,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 07:58:35,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:35,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-02 07:58:35,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:35,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 07:58:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 07:58:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 07:58:35,917 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-12-02 07:58:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:35,983 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 07:58:35,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 07:58:35,984 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-12-02 07:58:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:35,984 INFO L225 Difference]: With dead ends: 43 [2018-12-02 07:58:35,984 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 07:58:35,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 07:58:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 07:58:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-02 07:58:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 07:58:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-02 07:58:35,988 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-12-02 07:58:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:35,988 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-02 07:58:35,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 07:58:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-02 07:58:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 07:58:35,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:35,988 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:35,988 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:35,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:35,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-12-02 07:58:35,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:35,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:35,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:35,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:35,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 07:58:36,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:36,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:36,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:36,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:36,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:36,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:36,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:36,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:36,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 07:58:36,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:36,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 07:58:36,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 07:58:36,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-02 07:58:36,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:36,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 07:58:36,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 07:58:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 07:58:36,991 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 22 states. [2018-12-02 07:58:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:37,073 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-12-02 07:58:37,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 07:58:37,073 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-12-02 07:58:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:37,074 INFO L225 Difference]: With dead ends: 46 [2018-12-02 07:58:37,074 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 07:58:37,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 07:58:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 07:58:37,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 07:58:37,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 07:58:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 07:58:37,077 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-12-02 07:58:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:37,077 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 07:58:37,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 07:58:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-02 07:58:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 07:58:37,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:37,078 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:37,078 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:37,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-12-02 07:58:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:37,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:37,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 07:58:37,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:37,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:37,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:37,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:37,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:37,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:37,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:37,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:37,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:37,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 07:58:37,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-12-02 07:58:38,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-02 07:58:38,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:38,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 07:58:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 07:58:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 07:58:38,219 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 24 states. [2018-12-02 07:58:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:38,316 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-02 07:58:38,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 07:58:38,316 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-12-02 07:58:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:38,317 INFO L225 Difference]: With dead ends: 49 [2018-12-02 07:58:38,317 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 07:58:38,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 07:58:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 07:58:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 07:58:38,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 07:58:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-02 07:58:38,320 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-12-02 07:58:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:38,320 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-02 07:58:38,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 07:58:38,320 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-02 07:58:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 07:58:38,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:38,321 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:38,321 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:38,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-12-02 07:58:38,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:38,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:38,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 07:58:38,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:38,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:38,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:38,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:38,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:38,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:38,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:38,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:38,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 07:58:38,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 07:58:39,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:39,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-02 07:58:39,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:39,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 07:58:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 07:58:39,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 07:58:39,706 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 26 states. [2018-12-02 07:58:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:39,828 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-12-02 07:58:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 07:58:39,828 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-12-02 07:58:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:39,829 INFO L225 Difference]: With dead ends: 52 [2018-12-02 07:58:39,829 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 07:58:39,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=2033, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 07:58:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 07:58:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-02 07:58:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 07:58:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-02 07:58:39,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-12-02 07:58:39,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:39,832 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-02 07:58:39,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 07:58:39,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-02 07:58:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 07:58:39,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:39,833 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:39,833 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:39,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-12-02 07:58:39,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:39,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:39,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:39,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:39,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-02 07:58:40,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:40,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:40,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:40,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:40,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:40,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:40,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:40,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 07:58:40,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:40,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-02 07:58:40,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-12-02 07:58:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-02 07:58:41,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:41,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 07:58:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 07:58:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 07:58:41,369 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 28 states. [2018-12-02 07:58:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:41,535 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-02 07:58:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 07:58:41,535 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-12-02 07:58:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:41,535 INFO L225 Difference]: With dead ends: 55 [2018-12-02 07:58:41,536 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 07:58:41,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 07:58:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 07:58:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-02 07:58:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 07:58:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-02 07:58:41,539 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-12-02 07:58:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:41,539 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-02 07:58:41,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 07:58:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-02 07:58:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 07:58:41,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:41,540 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:41,540 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:41,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-12-02 07:58:41,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:41,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:41,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-02 07:58:41,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:41,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:41,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:41,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:41,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:41,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:41,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:41,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:41,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:41,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:41,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-02 07:58:41,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-12-02 07:58:43,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:43,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-02 07:58:43,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:43,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 07:58:43,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 07:58:43,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 07:58:43,264 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 30 states. [2018-12-02 07:58:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:43,429 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-12-02 07:58:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 07:58:43,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-12-02 07:58:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:43,429 INFO L225 Difference]: With dead ends: 58 [2018-12-02 07:58:43,430 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 07:58:43,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=2773, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 07:58:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 07:58:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-02 07:58:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 07:58:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-02 07:58:43,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-12-02 07:58:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:43,433 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-02 07:58:43,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 07:58:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-02 07:58:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 07:58:43,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:43,434 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:43,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:43,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-12-02 07:58:43,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:43,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:43,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:43,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 07:58:43,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:43,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:43,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:43,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:43,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:43,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/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-12-02 07:58:43,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:43,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:43,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 07:58:43,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-12-02 07:58:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-02 07:58:45,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:45,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 07:58:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 07:58:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 07:58:45,402 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 32 states. [2018-12-02 07:58:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:45,584 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-02 07:58:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 07:58:45,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-12-02 07:58:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:45,585 INFO L225 Difference]: With dead ends: 61 [2018-12-02 07:58:45,585 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 07:58:45,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=475, Invalid=3185, Unknown=0, NotChecked=0, Total=3660 [2018-12-02 07:58:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 07:58:45,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 07:58:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 07:58:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-02 07:58:45,589 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-12-02 07:58:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:45,589 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-02 07:58:45,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 07:58:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-02 07:58:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 07:58:45,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:45,590 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:45,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:45,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-12-02 07:58:45,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:45,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:45,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:45,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-02 07:58:45,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:45,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:45,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:45,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:45,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/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-12-02 07:58:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:45,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:46,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-02 07:58:46,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:46,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-02 07:58:46,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-12-02 07:58:48,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:48,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-02 07:58:48,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:48,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 07:58:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 07:58:48,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 07:58:48,206 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 34 states. [2018-12-02 07:58:48,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:48,449 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-12-02 07:58:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 07:58:48,450 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-12-02 07:58:48,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:48,450 INFO L225 Difference]: With dead ends: 64 [2018-12-02 07:58:48,450 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 07:58:48,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=535, Invalid=3625, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 07:58:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 07:58:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-02 07:58:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 07:58:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-02 07:58:48,454 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-12-02 07:58:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:48,454 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-02 07:58:48,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 07:58:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-02 07:58:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 07:58:48,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:48,455 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:48,455 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-12-02 07:58:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:48,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:48,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-02 07:58:48,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:48,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:48,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:48,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:48,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:48,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:48,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:48,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:48,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:48,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-02 07:58:48,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-12-02 07:58:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-02 07:58:50,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-02 07:58:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-02 07:58:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2018-12-02 07:58:50,926 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 36 states. [2018-12-02 07:58:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:51,184 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-02 07:58:51,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-02 07:58:51,185 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-12-02 07:58:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:51,185 INFO L225 Difference]: With dead ends: 67 [2018-12-02 07:58:51,185 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 07:58:51,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2018-12-02 07:58:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 07:58:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-02 07:58:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 07:58:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-02 07:58:51,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-12-02 07:58:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:51,189 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-02 07:58:51,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-02 07:58:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-02 07:58:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 07:58:51,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:51,190 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:51,190 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:51,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:51,190 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2018-12-02 07:58:51,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:51,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:51,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:51,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-02 07:58:51,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:51,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:51,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:51,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:51,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:51,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:51,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:51,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:58:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:51,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-02 07:58:51,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-12-02 07:58:53,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:53,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-02 07:58:53,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:53,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-02 07:58:53,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-02 07:58:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 07:58:53,792 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 38 states. [2018-12-02 07:58:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:54,033 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-12-02 07:58:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-02 07:58:54,033 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-12-02 07:58:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:54,033 INFO L225 Difference]: With dead ends: 70 [2018-12-02 07:58:54,033 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 07:58:54,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=667, Invalid=4589, Unknown=0, NotChecked=0, Total=5256 [2018-12-02 07:58:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 07:58:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-02 07:58:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 07:58:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-02 07:58:54,038 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-12-02 07:58:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:54,039 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-02 07:58:54,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-02 07:58:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-02 07:58:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 07:58:54,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:54,039 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:54,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:54,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2018-12-02 07:58:54,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:54,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:58:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:54,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-02 07:58:54,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:54,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:54,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:54,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:54,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:54,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:54,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 07:58:54,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 07:58:56,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-02 07:58:56,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:56,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-02 07:58:56,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:58:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-12-02 07:58:58,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:58:58,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-02 07:58:58,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:58:58,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-02 07:58:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-02 07:58:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2018-12-02 07:58:58,509 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 40 states. [2018-12-02 07:58:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:58:58,819 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-02 07:58:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-02 07:58:58,819 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-12-02 07:58:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:58:58,819 INFO L225 Difference]: With dead ends: 73 [2018-12-02 07:58:58,819 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 07:58:58,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=739, Invalid=5113, Unknown=0, NotChecked=0, Total=5852 [2018-12-02 07:58:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 07:58:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-02 07:58:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 07:58:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-02 07:58:58,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-12-02 07:58:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:58:58,823 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-02 07:58:58,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-02 07:58:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-02 07:58:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 07:58:58,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:58:58,824 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:58:58,824 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:58:58,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:58:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2018-12-02 07:58:58,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:58:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:58,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:58:58,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:58:58,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:58:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:58:59,374 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-02 07:58:59,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:59,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:58:59,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:58:59,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:58:59,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:58:59,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:58:59,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 07:58:59,381 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 07:58:59,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 07:58:59,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 07:58:59,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:58:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-02 07:58:59,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:59:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-02 07:59:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:59:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-02 07:59:02,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:59:02,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 07:59:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 07:59:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2018-12-02 07:59:02,190 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 42 states. [2018-12-02 07:59:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:59:02,498 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-12-02 07:59:02,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-02 07:59:02,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-12-02 07:59:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:59:02,499 INFO L225 Difference]: With dead ends: 76 [2018-12-02 07:59:02,499 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 07:59:02,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=815, Invalid=5665, Unknown=0, NotChecked=0, Total=6480 [2018-12-02 07:59:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 07:59:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 07:59:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 07:59:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-02 07:59:02,502 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-12-02 07:59:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:59:02,502 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 07:59:02,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 07:59:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-02 07:59:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 07:59:02,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:59:02,503 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:59:02,503 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:59:02,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:59:02,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2018-12-02 07:59:02,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:59:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:59:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 07:59:02,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:59:02,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:59:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:59:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-02 07:59:03,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:59:03,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:59:03,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 07:59:03,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 07:59:03,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:59:03,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:59:03,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:59:03,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:59:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:59:03,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:59:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-02 07:59:03,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:59:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-12-02 07:59:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:59:06,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-02 07:59:06,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:59:06,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 07:59:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 07:59:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2018-12-02 07:59:06,367 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 44 states. [2018-12-02 07:59:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:59:06,713 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-02 07:59:06,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 07:59:06,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-12-02 07:59:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:59:06,714 INFO L225 Difference]: With dead ends: 79 [2018-12-02 07:59:06,714 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 07:59:06,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=895, Invalid=6245, Unknown=0, NotChecked=0, Total=7140 [2018-12-02 07:59:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 07:59:06,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-02 07:59:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 07:59:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-02 07:59:06,717 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-12-02 07:59:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:59:06,717 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-02 07:59:06,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 07:59:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-02 07:59:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 07:59:06,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:59:06,717 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:59:06,718 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:59:06,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:59:06,718 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2018-12-02 07:59:06,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:59:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:59:06,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:59:06,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:59:06,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:59:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:59:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 07:59:06,837 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 07:59:06,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:59:06 BoogieIcfgContainer [2018-12-02 07:59:06,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:59:06,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:59:06,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:59:06,862 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:59:06,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:58:32" (3/4) ... [2018-12-02 07:59:06,865 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 07:59:06,908 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9e2fa4f0-e8bd-4ae7-b15a-7ef401cbc5bf/bin-2019/utaipan/witness.graphml [2018-12-02 07:59:06,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:59:06,909 INFO L168 Benchmark]: Toolchain (without parser) took 35148.42 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 592.4 MB). Free memory was 961.4 MB in the beginning and 1.3 GB in the end (delta: -297.9 MB). Peak memory consumption was 294.6 MB. Max. memory is 11.5 GB. [2018-12-02 07:59:06,910 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:59:06,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 119.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:59:06,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.39 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:59:06,910 INFO L168 Benchmark]: Boogie Preprocessor took 9.96 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:59:06,910 INFO L168 Benchmark]: RCFGBuilder took 133.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 07:59:06,911 INFO L168 Benchmark]: TraceAbstraction took 34825.39 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -153.2 MB). Peak memory consumption was 314.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:59:06,911 INFO L168 Benchmark]: Witness Printer took 45.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:59:06,912 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 119.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.39 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.96 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 133.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34825.39 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -153.2 MB). Peak memory consumption was 314.5 MB. Max. memory is 11.5 GB. * Witness Printer took 45.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 34.7s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 684 SDtfs, 2 SDslu, 14848 SDs, 0 SdLazy, 8769 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3235 GetRequests, 2320 SyntacticMatches, 19 SemanticMatches, 896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5788 ImplicationChecksByTransitivity, 18.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 4116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1430724 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2850 ConjunctsInSsa, 912 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 11400/22800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...