./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 ad4e6ad99a266ddeead98987e8e44db723af5bc7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:42:02,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 21:42:02,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 21:42:02,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 21:42:02,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 21:42:02,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 21:42:02,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 21:42:02,154 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 21:42:02,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 21:42:02,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 21:42:02,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 21:42:02,155 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 21:42:02,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 21:42:02,156 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 21:42:02,157 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 21:42:02,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 21:42:02,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 21:42:02,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 21:42:02,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 21:42:02,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 21:42:02,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 21:42:02,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 21:42:02,162 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 21:42:02,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 21:42:02,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 21:42:02,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 21:42:02,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 21:42:02,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 21:42:02,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 21:42:02,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 21:42:02,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 21:42:02,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 21:42:02,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 21:42:02,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 21:42:02,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 21:42:02,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 21:42:02,166 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 21:42:02,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 21:42:02,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 21:42:02,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 21:42:02,174 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 21:42:02,174 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 21:42:02,174 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 21:42:02,174 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 21:42:02,174 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 21:42:02,174 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 21:42:02,175 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 21:42:02,175 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 21:42:02,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 21:42:02,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 21:42:02,176 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 21:42:02,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 21:42:02,177 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 21:42:02,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 21:42:02,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 21:42:02,177 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 21:42:02,177 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_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 -> ad4e6ad99a266ddeead98987e8e44db723af5bc7 [2018-12-02 21:42:02,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 21:42:02,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 21:42:02,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 21:42:02,213 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 21:42:02,214 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 21:42:02,214 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2018-12-02 21:42:02,252 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/data/ba5bded37/aa179ba8add0441995a4fafbbbe4f671/FLAGd4fb7e61d [2018-12-02 21:42:02,696 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 21:42:02,697 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2018-12-02 21:42:02,700 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/data/ba5bded37/aa179ba8add0441995a4fafbbbe4f671/FLAGd4fb7e61d [2018-12-02 21:42:02,709 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/data/ba5bded37/aa179ba8add0441995a4fafbbbe4f671 [2018-12-02 21:42:02,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 21:42:02,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 21:42:02,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 21:42:02,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 21:42:02,716 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 21:42:02,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f0260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02, skipping insertion in model container [2018-12-02 21:42:02,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 21:42:02,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 21:42:02,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:42:02,828 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 21:42:02,837 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 21:42:02,845 INFO L195 MainTranslator]: Completed translation [2018-12-02 21:42:02,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02 WrapperNode [2018-12-02 21:42:02,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 21:42:02,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 21:42:02,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 21:42:02,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 21:42:02,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 21:42:02,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 21:42:02,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 21:42:02,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 21:42:02,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... [2018-12-02 21:42:02,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 21:42:02,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 21:42:02,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 21:42:02,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 21:42:02,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 21:42:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 21:42:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 21:42:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 21:42:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 21:42:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 21:42:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-12-02 21:42:02,938 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-12-02 21:42:03,015 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 21:42:03,015 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 21:42:03,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:42:03 BoogieIcfgContainer [2018-12-02 21:42:03,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 21:42:03,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 21:42:03,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 21:42:03,018 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 21:42:03,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:42:02" (1/3) ... [2018-12-02 21:42:03,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa54d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:42:03, skipping insertion in model container [2018-12-02 21:42:03,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:42:02" (2/3) ... [2018-12-02 21:42:03,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa54d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:42:03, skipping insertion in model container [2018-12-02 21:42:03,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:42:03" (3/3) ... [2018-12-02 21:42:03,020 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15_false-unreach-call_true-termination.c [2018-12-02 21:42:03,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 21:42:03,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 21:42:03,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 21:42:03,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 21:42:03,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 21:42:03,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 21:42:03,054 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 21:42:03,054 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 21:42:03,054 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 21:42:03,054 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 21:42:03,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 21:42:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-02 21:42:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 21:42:03,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:03,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 21:42:03,068 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:03,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-12-02 21:42:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:03,162 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 21:42:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 21:42:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 21:42:03,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:42:03,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 21:42:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 21:42:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 21:42:03,176 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-12-02 21:42:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:03,215 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-02 21:42:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 21:42:03,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 21:42:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:03,222 INFO L225 Difference]: With dead ends: 30 [2018-12-02 21:42:03,223 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 21:42:03,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 21:42:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 21:42:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-02 21:42:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-02 21:42:03,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-02 21:42:03,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-12-02 21:42:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:03,249 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-02 21:42:03,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 21:42:03,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-02 21:42:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 21:42:03,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:03,250 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 21:42:03,250 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:03,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-12-02 21:42:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:03,289 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 21:42:03,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:03,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:03,290 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-12-02 21:42:03,291 INFO L205 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-12-02 21:42:03,309 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 21:42:03,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 21:42:03,399 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-02 21:42:03,401 INFO L272 AbstractInterpreter]: Visited 16 different actions 49 times. Never merged. Widened at 1 different actions 2 times. Performed 105 root evaluator evaluations with a maximum evaluation depth of 3. Performed 105 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-02 21:42:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:03,406 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-02 21:42:03,436 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 58.33% of their original sizes. [2018-12-02 21:42:03,436 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-02 21:42:03,508 INFO L418 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-12-02 21:42:03,508 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-02 21:42:03,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 21:42:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-12-02 21:42:03,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 21:42:03,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 21:42:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 21:42:03,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-02 21:42:03,511 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 12 states. [2018-12-02 21:42:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:03,712 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-02 21:42:03,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:42:03,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-02 21:42:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:03,713 INFO L225 Difference]: With dead ends: 39 [2018-12-02 21:42:03,713 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 21:42:03,714 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:42:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 21:42:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-12-02 21:42:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 21:42:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-02 21:42:03,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 19 [2018-12-02 21:42:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:03,718 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-02 21:42:03,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 21:42:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-02 21:42:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 21:42:03,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:03,719 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 21:42:03,719 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:03,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-12-02 21:42:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:03,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:03,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:03,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:03,765 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 21:42:03,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:03,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:03,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:03,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:03,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:03,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:03,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:03,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:03,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 21:42:03,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:03,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:03,815 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 21:42:03,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 21:42:04,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:04,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2018-12-02 21:42:04,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:04,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 21:42:04,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 21:42:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-02 21:42:04,012 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-12-02 21:42:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:04,048 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-02 21:42:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 21:42:04,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-12-02 21:42:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:04,050 INFO L225 Difference]: With dead ends: 49 [2018-12-02 21:42:04,050 INFO L226 Difference]: Without dead ends: 39 [2018-12-02 21:42:04,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-02 21:42:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-02 21:42:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-12-02 21:42:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 21:42:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-02 21:42:04,054 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2018-12-02 21:42:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:04,054 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-02 21:42:04,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 21:42:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-02 21:42:04,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 21:42:04,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:04,055 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 21:42:04,056 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:04,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-12-02 21:42:04,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:04,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:04,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:04,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:04,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:04,130 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 21:42:04,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:04,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:04,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:04,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:04,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:04,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:04,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:42:04,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:42:04,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:42:04,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:04,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:04,198 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 21:42:04,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 21:42:04,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:04,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 22 [2018-12-02 21:42:04,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:04,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 21:42:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 21:42:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-12-02 21:42:04,494 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 17 states. [2018-12-02 21:42:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:04,606 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-02 21:42:04,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 21:42:04,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-02 21:42:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:04,607 INFO L225 Difference]: With dead ends: 52 [2018-12-02 21:42:04,607 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 21:42:04,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-12-02 21:42:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 21:42:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-12-02 21:42:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 21:42:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 21:42:04,611 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-12-02 21:42:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:04,611 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 21:42:04,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 21:42:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 21:42:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 21:42:04,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:04,612 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 21:42:04,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:04,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:04,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-12-02 21:42:04,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:04,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:04,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:04,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:04,656 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 21:42:04,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:04,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:04,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:04,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:04,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:04,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:04,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:04,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:42:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:04,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:04,690 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 21:42:04,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 21:42:05,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:05,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2018-12-02 21:42:05,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:05,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 21:42:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 21:42:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-12-02 21:42:05,080 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2018-12-02 21:42:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:05,123 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-02 21:42:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 21:42:05,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-02 21:42:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:05,124 INFO L225 Difference]: With dead ends: 55 [2018-12-02 21:42:05,124 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 21:42:05,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2018-12-02 21:42:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 21:42:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-12-02 21:42:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 21:42:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-02 21:42:05,128 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 37 [2018-12-02 21:42:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:05,128 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-02 21:42:05,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 21:42:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-02 21:42:05,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 21:42:05,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:05,129 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 21:42:05,129 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:05,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-12-02 21:42:05,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:05,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:05,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:05,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:05,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:05,216 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 21:42:05,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:05,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:05,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:05,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:05,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:05,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:05,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:05,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:05,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 21:42:05,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:05,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:05,323 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 21:42:05,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 21:42:05,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:05,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 15] total 30 [2018-12-02 21:42:05,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:05,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 21:42:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 21:42:05,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-02 21:42:05,954 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 23 states. [2018-12-02 21:42:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:06,111 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-02 21:42:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:42:06,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-02 21:42:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:06,112 INFO L225 Difference]: With dead ends: 58 [2018-12-02 21:42:06,112 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 21:42:06,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:42:06,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 21:42:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-12-02 21:42:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 21:42:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-02 21:42:06,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 43 [2018-12-02 21:42:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:06,117 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-02 21:42:06,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 21:42:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-02 21:42:06,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 21:42:06,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:06,118 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 21:42:06,118 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:06,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:06,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-12-02 21:42:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:06,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:06,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:06,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:06,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:06,211 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 21:42:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:06,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:06,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:06,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:06,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:06,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:42:06,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:42:06,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:42:06,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:06,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:06,303 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 21:42:06,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-02 21:42:07,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:07,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 17] total 34 [2018-12-02 21:42:07,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:07,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 21:42:07,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 21:42:07,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 21:42:07,168 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 26 states. [2018-12-02 21:42:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:07,337 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-02 21:42:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 21:42:07,338 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-12-02 21:42:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:07,338 INFO L225 Difference]: With dead ends: 61 [2018-12-02 21:42:07,338 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 21:42:07,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 68 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=1740, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 21:42:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 21:42:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2018-12-02 21:42:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 21:42:07,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-02 21:42:07,343 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 49 [2018-12-02 21:42:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:07,343 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-02 21:42:07,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 21:42:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-02 21:42:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 21:42:07,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:07,344 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 21:42:07,344 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:07,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-12-02 21:42:07,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:07,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:07,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:07,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:07,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:07,450 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 21:42:07,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:07,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:07,451 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:07,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:07,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:07,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:07,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:07,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:42:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:07,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:07,573 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 21:42:07,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 21:42:08,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:08,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 19] total 38 [2018-12-02 21:42:08,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:08,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 21:42:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 21:42:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 21:42:08,705 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-12-02 21:42:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:08,908 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-02 21:42:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 21:42:08,908 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-12-02 21:42:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:08,909 INFO L225 Difference]: With dead ends: 64 [2018-12-02 21:42:08,909 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 21:42:08,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2018-12-02 21:42:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 21:42:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 21:42:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 21:42:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-02 21:42:08,914 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 55 [2018-12-02 21:42:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:08,914 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-02 21:42:08,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 21:42:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-02 21:42:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 21:42:08,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:08,915 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 21:42:08,915 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:08,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:08,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-12-02 21:42:08,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:08,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:08,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:08,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:08,974 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 21:42:08,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:08,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:08,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:08,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:08,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:08,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:08,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:08,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 21:42:08,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:08,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:09,165 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 21:42:09,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:10,514 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 21:42:10,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:10,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 21] total 46 [2018-12-02 21:42:10,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:10,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 21:42:10,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 21:42:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1747, Unknown=0, NotChecked=0, Total=2070 [2018-12-02 21:42:10,529 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 32 states. [2018-12-02 21:42:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:10,747 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-02 21:42:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 21:42:10,747 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-12-02 21:42:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:10,748 INFO L225 Difference]: With dead ends: 67 [2018-12-02 21:42:10,748 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 21:42:10,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=702, Invalid=3204, Unknown=0, NotChecked=0, Total=3906 [2018-12-02 21:42:10,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 21:42:10,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-12-02 21:42:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 21:42:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-02 21:42:10,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 61 [2018-12-02 21:42:10,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:10,752 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-02 21:42:10,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 21:42:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-02 21:42:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 21:42:10,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:10,752 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 21:42:10,752 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:10,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:10,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-12-02 21:42:10,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:10,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:10,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:10,814 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 21:42:10,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:10,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:10,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:10,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:10,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:10,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:42:10,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:42:10,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:42:10,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:10,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:10,840 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 21:42:10,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 21:42:12,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:12,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2018-12-02 21:42:12,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:12,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 21:42:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 21:42:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-12-02 21:42:12,825 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 14 states. [2018-12-02 21:42:12,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:12,910 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-02 21:42:12,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 21:42:12,911 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-12-02 21:42:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:12,911 INFO L225 Difference]: With dead ends: 70 [2018-12-02 21:42:12,912 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 21:42:12,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 113 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2018-12-02 21:42:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 21:42:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-12-02 21:42:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 21:42:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-02 21:42:12,917 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 67 [2018-12-02 21:42:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:12,918 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-02 21:42:12,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 21:42:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-02 21:42:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 21:42:12,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:12,919 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 21:42:12,919 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:12,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-12-02 21:42:12,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:12,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:12,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:12,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:13,005 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 21:42:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:13,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:13,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:13,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:13,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:13,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:13,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:42:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:13,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:13,031 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 21:42:13,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-02 21:42:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2018-12-02 21:42:15,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 21:42:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 21:42:15,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-12-02 21:42:15,737 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 15 states. [2018-12-02 21:42:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:15,824 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-02 21:42:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 21:42:15,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-12-02 21:42:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:15,825 INFO L225 Difference]: With dead ends: 73 [2018-12-02 21:42:15,825 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 21:42:15,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 123 SyntacticMatches, 22 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 21:42:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 21:42:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-02 21:42:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-02 21:42:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-02 21:42:15,830 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 73 [2018-12-02 21:42:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:15,830 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-02 21:42:15,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 21:42:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-02 21:42:15,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 21:42:15,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:15,831 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 21:42:15,831 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:15,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:15,831 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-12-02 21:42:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:15,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:15,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:15,911 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 21:42:15,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:15,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:15,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:15,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:15,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:15,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:15,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:15,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:15,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 21:42:15,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:15,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:15,949 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 21:42:15,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-02 21:42:19,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2018-12-02 21:42:19,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:19,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 21:42:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 21:42:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-12-02 21:42:19,278 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 16 states. [2018-12-02 21:42:19,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:19,380 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-02 21:42:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 21:42:19,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-12-02 21:42:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:19,381 INFO L225 Difference]: With dead ends: 76 [2018-12-02 21:42:19,381 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 21:42:19,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 133 SyntacticMatches, 24 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 21:42:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 21:42:19,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-12-02 21:42:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 21:42:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-02 21:42:19,385 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 79 [2018-12-02 21:42:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:19,385 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-02 21:42:19,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 21:42:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-02 21:42:19,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 21:42:19,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:19,386 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 21:42:19,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:19,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-12-02 21:42:19,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:19,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:19,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:19,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:19,594 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 21:42:19,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:19,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:19,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:19,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 21:42:19,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:19,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:19,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 21:42:19,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 21:42:19,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 21:42:19,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:19,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:19,811 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 21:42:19,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 21:42:24,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:24,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17, 29] total 58 [2018-12-02 21:42:24,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:24,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 21:42:24,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 21:42:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2866, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 21:42:24,344 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 44 states. [2018-12-02 21:42:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:24,718 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-02 21:42:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 21:42:24,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-12-02 21:42:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:24,718 INFO L225 Difference]: With dead ends: 79 [2018-12-02 21:42:24,718 INFO L226 Difference]: Without dead ends: 69 [2018-12-02 21:42:24,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 116 SyntacticMatches, 26 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1322, Invalid=5484, Unknown=0, NotChecked=0, Total=6806 [2018-12-02 21:42:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-02 21:42:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-12-02 21:42:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 21:42:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-02 21:42:24,722 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 85 [2018-12-02 21:42:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:24,723 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-02 21:42:24,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 21:42:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-02 21:42:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 21:42:24,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:24,723 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 21:42:24,723 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:24,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-12-02 21:42:24,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:24,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:24,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:24,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:24,901 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 21:42:24,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:24,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:24,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:24,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:24,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:24,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:24,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 21:42:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:24,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:25,133 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 21:42:25,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-02 21:42:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18, 31] total 62 [2018-12-02 21:42:30,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:30,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-02 21:42:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-02 21:42:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=3281, Unknown=0, NotChecked=0, Total=3782 [2018-12-02 21:42:30,349 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 47 states. [2018-12-02 21:42:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:30,777 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-02 21:42:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-02 21:42:30,777 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-12-02 21:42:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:30,778 INFO L225 Difference]: With dead ends: 82 [2018-12-02 21:42:30,778 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 21:42:30,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 124 SyntacticMatches, 28 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1521, Invalid=6311, Unknown=0, NotChecked=0, Total=7832 [2018-12-02 21:42:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 21:42:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-12-02 21:42:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 21:42:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-02 21:42:30,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 91 [2018-12-02 21:42:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:30,782 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-02 21:42:30,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-02 21:42:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-02 21:42:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 21:42:30,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:30,783 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 21:42:30,783 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:30,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-12-02 21:42:30,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:30,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:30,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 21:42:30,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:30,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 21:42:30,998 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 21:42:30,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:30,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 21:42:30,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 21:42:30,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 21:42:30,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 21:42:30,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/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 21:42:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 21:42:31,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 21:42:31,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-02 21:42:31,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 21:42:31,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 21:42:31,277 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 21:42:31,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 21:42:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-02 21:42:38,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 21:42:38,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19, 33] total 65 [2018-12-02 21:42:38,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 21:42:38,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-02 21:42:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-02 21:42:38,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=3597, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 21:42:38,819 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 50 states. [2018-12-02 21:42:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 21:42:39,253 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-02 21:42:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 21:42:39,253 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-12-02 21:42:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 21:42:39,254 INFO L225 Difference]: With dead ends: 85 [2018-12-02 21:42:39,254 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 21:42:39,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 132 SyntacticMatches, 31 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2449 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1731, Invalid=7011, Unknown=0, NotChecked=0, Total=8742 [2018-12-02 21:42:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 21:42:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-12-02 21:42:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 21:42:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-02 21:42:39,259 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 97 [2018-12-02 21:42:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 21:42:39,259 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-02 21:42:39,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-02 21:42:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-02 21:42:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 21:42:39,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 21:42:39,260 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 21:42:39,260 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 21:42:39,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 21:42:39,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-12-02 21:42:39,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 21:42:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:39,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 21:42:39,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 21:42:39,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 21:42:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:42:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 21:42:39,281 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 21:42:39,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:42:39 BoogieIcfgContainer [2018-12-02 21:42:39,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 21:42:39,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 21:42:39,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 21:42:39,299 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 21:42:39,299 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:42:03" (3/4) ... [2018-12-02 21:42:39,300 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 21:42:39,329 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec3b4d7c-7dc9-4d8a-98ae-fd9753f84058/bin-2019/utaipan/witness.graphml [2018-12-02 21:42:39,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 21:42:39,330 INFO L168 Benchmark]: Toolchain (without parser) took 36618.81 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 663.7 MB). Free memory was 953.5 MB in the beginning and 1.4 GB in the end (delta: -410.5 MB). Peak memory consumption was 253.3 MB. Max. memory is 11.5 GB. [2018-12-02 21:42:39,331 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:42:39,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 21:42:39,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:42:39,332 INFO L168 Benchmark]: Boogie Preprocessor took 11.13 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 21:42:39,332 INFO L168 Benchmark]: RCFGBuilder took 146.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:42:39,332 INFO L168 Benchmark]: TraceAbstraction took 36281.93 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -258.8 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2018-12-02 21:42:39,332 INFO L168 Benchmark]: Witness Printer took 31.07 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-02 21:42:39,334 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.18 ms. Allocated memory is still 1.0 GB. Free memory was 953.5 MB in the beginning and 942.7 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.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.13 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -179.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36281.93 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 522.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -258.8 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. * Witness Printer took 31.07 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. 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] int input = 15; VAL [input=15] [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 36.2s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 257 SDslu, 2408 SDs, 0 SdLazy, 1451 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2057 GetRequests, 1198 SyntacticMatches, 222 SemanticMatches, 637 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10261 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.6944444444444444 AbsIntWeakeningRatio, 0.5555555555555556 AbsIntAvgWeakeningVarsNumRemoved, 0.8333333333333334 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 119 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 1721 NumberOfCodeBlocks, 1721 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 2370 ConstructedInterpolants, 0 QuantifiedInterpolants, 435528 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1872 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 41 InterpolantComputations, 1 PerfectInterpolantSequences, 3771/9442 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...